scholarly journals HISAT-3N: a rapid and accurate three-nucleotide sequence aligner

2020 ◽  
Author(s):  
Yun Zhang ◽  
Chanhee Park ◽  
Christopher Bennett ◽  
Micah Thornton ◽  
Daehwan Kim
Keyword(s):  
Nucleotide Sequence ◽  
Simulated Data ◽  
Alignment Accuracy ◽  
Data Sets ◽  
Cellular Processes ◽  
Sequencing Technologies ◽  
Spliced Alignment ◽  
Hierarchical Index ◽  
Simulated Data Sets ◽  
The Ideal

Nucleotide conversion sequencing technologies such as bisulfite-seq and SLAM-seq are powerful tools to explore the intricacies of cellular processes. In this paper, we describe HISAT-3N (hierarchical indexing for spliced alignment of transcripts - 3 nucleotides), which rapidly and accurately aligns sequences consisting of nucleotide conversions by leveraging powerful hierarchical index and repeat index algorithms originally developed for the HISAT software. Tests on real and simulated data sets demonstrate that HISAT-3N is over 7 times faster, has greater alignment accuracy, and has smaller memory requirements than other modern systems. Taken together HISAT-3N is the ideal aligner for use with converted sequence technologies.

scholarly journals HISAT: Hierarchical Indexing for Spliced Alignment of Transcripts

2014 ◽  
Author(s):  
Daehwan Kim ◽  
Ben Langmead ◽  
Steven Salzberg
Keyword(s):  
Human Genome ◽  
Simulated Data ◽  
Genomic Region ◽  
Data Sets ◽  
Rna Seq ◽  
Efficient System ◽  
Spliced Alignment ◽  
Burrows Wheeler Transform ◽  
Simulated Data Sets ◽  
Free Open Source

HISAT is a new, highly efficient system for alignment of sequences from RNA sequencing experiments that achieves dramatically faster performance than previous methods. HISAT uses a new indexing scheme, hierarchical indexing, which is based on the Burrows-Wheeler transform and the Ferragina-Manzini (FM) index. Hierarchical indexing employs two types of indexes for alignment: (1) a whole-genome FM index to anchor each alignment, and (2) numerous local FM indexes for very rapid extensions of these alignments. HISAT?s hierarchical index for the human genome contains 48,000 local FM indexes, each representing a genomic region of ~64,000 bp. The algorithm includes several customized alignment strategies specifically designed for mapping RNA-seq reads across multiple exons. In tests on a variety of real and simulated data sets, we show that HISAT is the fastest system currently available, approximately 50 times faster than TopHat2 and 12 times faster than GSNAP, with equal or better accuracy than any other method. Despite its very large number of indexes, HISAT requires only 4.3 Gigabytes of memory to align reads to the human genome. HISAT supports genomes of any size, including those larger than 4 billion bases. HISAT is available as free, open-source software from http://www.ccb.jhu.edu/software/hisat.

scholarly journals Spectral Convolution Feature-Based SPD Matrix Representation for Signal Detection Using a Deep Neural Network

Entropy ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. 949
Author(s):  
Jiangyi Wang ◽  
Min Liu ◽  
Xinwu Zeng ◽  
Xiaoqiang Hua
Keyword(s):  
Neural Network ◽  
Signal Detection ◽  
Convolutional Neural Network ◽  
Deep Neural Network ◽  
Detection Method ◽  
Learning Algorithm ◽  
Simulated Data ◽  
Data Sets ◽  
Feature Maps ◽  
Simulated Data Sets

Convolutional neural networks have powerful performances in many visual tasks because of their hierarchical structures and powerful feature extraction capabilities. SPD (symmetric positive definition) matrix is paid attention to in visual classification, because it has excellent ability to learn proper statistical representation and distinguish samples with different information. In this paper, a deep neural network signal detection method based on spectral convolution features is proposed. In this method, local features extracted from convolutional neural network are used to construct the SPD matrix, and a deep learning algorithm for the SPD matrix is used to detect target signals. Feature maps extracted by two kinds of convolutional neural network models are applied in this study. Based on this method, signal detection has become a binary classification problem of signals in samples. In order to prove the availability and superiority of this method, simulated and semi-physical simulated data sets are used. The results show that, under low SCR (signal-to-clutter ratio), compared with the spectral signal detection method based on the deep neural network, this method can obtain a gain of 0.5–2 dB on simulated data sets and semi-physical simulated data sets.

scholarly journals Benchmarking Statistical Multiple Sequence Alignment

2018 ◽  
Author(s):  
Michael Nute ◽  
Ehsan Saleh ◽  
Tandy Warnow
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Structural Alignment ◽  
Estimation Method ◽  
Simulated Data ◽  
Protein Sequences ◽  
Data Sets ◽  
Sequence Alignments ◽  
Multiple Sequence ◽  
Simulated Data Sets

AbstractThe estimation of multiple sequence alignments of protein sequences is a basic step in many bioinformatics pipelines, including protein structure prediction, protein family identification, and phylogeny estimation. Statistical co-estimation of alignments and trees under stochastic models of sequence evolution has long been considered the most rigorous technique for estimating alignments and trees, but little is known about the accuracy of such methods on biological benchmarks. We report the results of an extensive study evaluating the most popular protein alignment methods as well as the statistical co-estimation method BAli-Phy on 1192 protein data sets from established benchmarks as well as on 120 simulated data sets. Our study (which used more than 230 CPU years for the BAli-Phy analyses alone) shows that BAli-Phy is dramatically more accurate than the other alignment methods on the simulated data sets, but is among the least accurate on the biological benchmarks. There are several potential causes for this discordance, including model misspecification, errors in the reference alignments, and conflicts between structural alignment and evolutionary alignments; future research is needed to understand the most likely explanation for our observations. multiple sequence alignment, BAli-Phy, protein sequences, structural alignment, homology

scholarly journals Bayesian Planet Searches for the 10 cm/s Radial Velocity Era

2015 ◽  
Vol 11 (A29A) ◽  
pp. 205-207
Author(s):  
Philip C. Gregory
Keyword(s):  
Radial Velocity ◽  
State Of The Art ◽  
Simulated Data ◽  
Model Parameters ◽  
Data Sets ◽  
Stellar Activity ◽  
Bayesian Fusion ◽  
Multiple State ◽  
Simulated Data Sets ◽  
Apodization Function

AbstractA new apodized Keplerian model is proposed for the analysis of precision radial velocity (RV) data to model both planetary and stellar activity (SA) induced RV signals. A symmetrical Gaussian apodization function with unknown width and center can distinguish planetary signals from SA signals on the basis of the width of the apodization function. The general model for m apodized Keplerian signals also includes a linear regression term between RV and the stellar activity diagnostic In (R'hk), as well as an extra Gaussian noise term with unknown standard deviation. The model parameters are explored using a Bayesian fusion MCMC code. A differential version of the Generalized Lomb-Scargle periodogram provides an additional way of distinguishing SA signals and helps guide the choice of new periods. Sample results are reported for a recent international RV blind challenge which included multiple state of the art simulated data sets supported by a variety of stellar activity diagnostics.

An evaluation of HapMap sample size and tagging SNP performance in large-scale empirical and simulated data sets

2005 ◽  
Vol 37 (12) ◽  
pp. 1320-1322 ◽  
Author(s):  
Eleftheria Zeggini ◽  
William Rayner ◽  
Andrew P Morris ◽  
Andrew T Hattersley ◽  
Mark Walker ◽  
...  
Keyword(s):  
Sample Size ◽  
Large Scale ◽  
Simulated Data ◽  
Data Sets ◽  
Hapmap Sample ◽  
Tagging Snp ◽  
Simulated Data Sets

scholarly journals Evaluating Phylogenetic Informativeness as a Predictor of Phylogenetic Signal for Metazoan, Fungal, and Mammalian Phylogenomic Data Sets

2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
Francesc López-Giráldez ◽  
Andrew H. Moeller ◽  
Jeffrey P. Townsend
Keyword(s):  
Phylogenetic Signal ◽  
Simulated Data ◽  
Quantitative Measure ◽  
Data Sets ◽  
Phylogenetic Informativeness ◽  
Phylogenetic Resolution ◽  
Taxonomic Groups ◽  
Diverse Groups ◽  
Simulated Data Sets ◽  
Selection Of

Phylogenetic research is often stymied by selection of a marker that leads to poor phylogenetic resolution despite considerable cost and effort. Profiles of phylogenetic informativeness provide a quantitative measure for prioritizing gene sampling to resolve branching order in a particular epoch. To evaluate the utility of these profiles, we analyzed phylogenomic data sets from metazoans, fungi, and mammals, thus encompassing diverse time scales and taxonomic groups. We also evaluated the utility of profiles created based on simulated data sets. We found that genes selected via their informativeness dramatically outperformed haphazard sampling of markers. Furthermore, our analyses demonstrate that the original phylogenetic informativeness method can be extended to trees with more than four taxa. Thus, although the method currently predicts phylogenetic signal without specifically accounting for the misleading effects of stochastic noise, it is robust to the effects of homoplasy. The phylogenetic informativeness rankings obtained will allow other researchers to select advantageous genes for future studies within these clades, maximizing return on effort and investment. Genes identified might also yield efficient experimental designs for phylogenetic inference for many sister clades and outgroup taxa that are closely related to the diverse groups of organisms analyzed.

Sign in / Sign up

Export Citation Format

Share Document