scholarly journals Bit-parallel sequence-to-graph alignment

2019 ◽  
Vol 35 (19) ◽  
pp. 3599-3607 ◽  
Author(s):  
Mikko Rautiainen ◽  
Veli Mäkinen ◽  
Tobias Marschall
Keyword(s):  
Variant Calling ◽  
Supplementary Information ◽  
Global Alignment ◽  
Alignment Algorithm ◽  
Exact Matching ◽  
Worst Case ◽  
De Bruijn Graphs ◽  
Graph Alignment ◽  
Linear Sequence ◽  
String Graphs

Abstract Motivation Graphs are commonly used to represent sets of sequences. Either edges or nodes can be labeled by sequences, so that each path in the graph spells a concatenated sequence. Examples include graphs to represent genome assemblies, such as string graphs and de Bruijn graphs, and graphs to represent a pan-genome and hence the genetic variation present in a population. Being able to align sequencing reads to such graphs is a key step for many analyses and its applications include genome assembly, read error correction and variant calling with respect to a variation graph. Results We generalize two linear sequence-to-sequence algorithms to graphs: the Shift-And algorithm for exact matching and Myers’ bitvector algorithm for semi-global alignment. These linear algorithms are both based on processing w sequence characters with a constant number of operations, where w is the word size of the machine (commonly 64), and achieve a speedup of up to w over naive algorithms. For a graph with |V| nodes and |E| edges and a sequence of length m, our bitvector-based graph alignment algorithm reaches a worst case runtime of O(|V|+⌈mw⌉|E| log w) for acyclic graphs and O(|V|+m|E| log w) for arbitrary cyclic graphs. We apply it to five different types of graphs and observe a speedup between 3-fold and 20-fold compared with a previous (asymptotically optimal) alignment algorithm. Availability and implementation https://github.com/maickrau/GraphAligner Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Bit-parallel sequence-to-graph alignment

2018 ◽  
Author(s):  
Mikko Rautiainen ◽  
Veli Mäkinen ◽  
Tobias Marschall
Keyword(s):  
Variant Calling ◽  
Global Alignment ◽  
Alignment Algorithm ◽  
Exact Matching ◽  
Worst Case ◽  
De Bruijn Graphs ◽  
Graph Alignment ◽  
Linear Sequence ◽  
String Graphs ◽  
Linear Algorithms

Graphs are commonly used to represent sets of sequences. Either edges or nodes can be labeled by sequences, so that each path in the graph spells a concatenated sequence. Examples include graphs to represent genome assemblies, such as string graphs and de Bruijn graphs, and graphs to represent a pan-genome and hence the genetic variation present in a population. Being able to align sequencing reads to such graphs is a key step for many analyses and its applications include genome assembly, read error correction, and variant calling with respect to a variation graph. Here, we generalize two linear sequence-to-sequence algorithms to graphs: the Shift-And algorithm for exact matching and Myers’ bitvector algorithm for semi-global alignment. These linear algorithms are both based on processing w sequence characters with a constant number of operations, where w is the word size of the machine (commonly 64), and achieve a speedup of w over naive algorithms. Our bitvector-based graph alignment algorithm reaches a worst case runtime of for acyclic graphs and O(V + mE log w) for arbitrary cyclic graphs. We apply it to four different types of graphs and observe a speedup between 3.1-fold and 10.1-fold compared to previous algorithms.

scholarly journals Aligning sequences to general graphs in O(V + mE) time

2017 ◽  
Author(s):  
Mikko Rautiainen ◽  
Tobias Marschall
Keyword(s):  
Basic Problem ◽  
Variant Calling ◽  
Theory And Practice ◽  
De Bruijn Graphs ◽  
Topological Features ◽  
String Graphs ◽  
Wide Range ◽  
Read Error Correction ◽  
Genome Assemblies ◽  
General Graphs

Graphs are commonly used to represent sets of sequences. Either edges or nodes can be labeled by sequences, so that each path in the graph spells a concatenated sequence. Examples include graphs to represent genome assemblies, such as string graphs and de Bruijn graphs, and graphs to represent a pan-genome and hence the genetic variation present in a population. Being able to align sequencing reads to such graphs is a key step for many analyses and its applications include genome assembly, read error correction, and variant calling with respect to a variation graph. Given the wide range of applications of this basic problem, it is surprising that algorithms with optimal runtime are, to the best of our knowledge, yet unknown. In particular, aligning sequences to cyclic graphs currently represents a challenge both in theory and practice. Here, we introduce an algorithm to compute the minimum edit distance of a sequence of length m to any path in a node-labeled directed graph (V, E) in O(|V |+m|E|) time and O(|V |) space. The corresponding alignment can be obtained in the same runtime using space. The time complexity depends only on the length of the sequence and the size of the graph. In particular, it does not depend on the cyclicity of the graph, or any other topological features.

CLASSIFICATION AND IDENTIFICATION OF FUNGAL SEQUENCES USING CHARACTERISTIC RESTRICTION ENDONUCLEASE CUT ORDER

2010 ◽  
Vol 08 (02) ◽  
pp. 181-198 ◽  
Author(s):  
RAJIB SENGUPTA ◽  
DHUNDY R. BASTOLA ◽  
HESHAM H. ALI
Keyword(s):  
Dna Sequences ◽  
Restriction Enzymes ◽  
Epidemiological Studies ◽  
Global Alignment ◽  
Target Sequence ◽  
Alignment Algorithm ◽  
Molecular Fingerprinting ◽  
Data Set ◽  
Alignment Free ◽  
Wet Lab

Restriction Fragment Length Polymorphism (RFLP) is a powerful molecular tool that is extensively used in the molecular fingerprinting and epidemiological studies of microorganisms. In a wet-lab setting, the DNA is cut with one or more restriction enzymes and subjected to gel electrophoresis to obtain signature fragment patterns, which is utilized in the classification and identification of organisms. This wet-lab approach may not be practical when the experimental data set includes a large number of genetic sequences and a wide pool of restriction enzymes to choose from. In this study, we introduce a novel concept of Enzyme Cut Order — a biological property-based characteristic of DNA sequences which can be defined and analyzed computationally without any alignment algorithm. In this alignment-free approach, a similarity matrix is developed based on the pairwise Longest Common Subsequences (LCS) of the Enzyme Cut Orders. The choice of an ideal set of restriction enzymes used for analysis is augmented by using genetic algorithms. The results obtained from this approach using internal transcribed spacer regions of rDNA from fungi as the target sequence show that the phylogenetically-related organisms form a single cluster and successful grouping of phylogenetically close or distant organisms is dependent on the choice of restriction enzymes used in the analysis. Additionally, comparison of trees obtained with this alignment-free and the legacy method revealed highly similar tree topologies. This novel alignment-free method, which utilizes the Enzyme Cut Order and restriction enzyme profile, is a reliable alternative to local or global alignment-based classification and identification of organisms.

scholarly journals tHapMix: simulating tumour samples through haplotype mixtures

2016 ◽  
Author(s):  
Sergii Ivakhno ◽  
Camilla Colombo ◽  
Stephen Tanner ◽  
Philip Tedder ◽  
Stefano Berri ◽  
...  
Keyword(s):  
Copy Number ◽  
Large Scale ◽  
Variant Calling ◽  
Copy Number Variant ◽  
Supplementary Information ◽  
Genome Diversity ◽  
Simulation Framework ◽  
Somatic Genome ◽  
Copy Number Changes ◽  
Sequencing Platforms

AbstractMotivationLarge-scale rearrangements and copy number changes combined with different modes of cloevolution create extensive somatic genome diversity, making it difficult to develop versatile and scalable oriant calling tools and create well-calibrated benchmarks.ResultsWe developed a new simulation framework tHapMix that enables the creation of tumour samples with different ploidy, purity and polyclonality features. It easily scales to simulation of hundreds of somatic genomes, while re-use of real read data preserves noise and biases present in sequencing platforms. We further demonstrate tHapMix utility by creating a simulated set of 140 somatic genomes and showing how it can be used in training and testing of somatic copy number variant calling tools.Availability and implementationtHapMix is distributed under an open source license and can be downloaded from https://github.com/Illumina/[email protected] informationSupplementary data are available at Bioinformatics online.

Numt identification and removal with RtN!

2020 ◽  
Vol 36 (20) ◽  
pp. 5115-5116 ◽  
Author(s):  
August E Woerner ◽  
Jennifer Churchill Cihlar ◽  
Utpal Smart ◽  
Bruce Budowle
Keyword(s):  
Mitochondrial Genome ◽  
Massively Parallel Sequencing ◽  
Sequence Similarity ◽  
Variant Calling ◽  
Supplementary Information ◽  
Mitochondrial Genomes ◽  
Sequencing Data ◽  
Read Mapping ◽  
Genome Data ◽  
Mitochondrial Sequences

Abstract Motivation Assays in mitochondrial genomics rely on accurate read mapping and variant calling. However, there are known and unknown nuclear paralogs that have fundamentally different genetic properties than that of the mitochondrial genome. Such paralogs complicate the interpretation of mitochondrial genome data and confound variant calling. Results Remove the Numts! (RtN!) was developed to categorize reads from massively parallel sequencing data not based on the expected properties and sequence identities of paralogous nuclear encoded mitochondrial sequences, but instead using sequence similarity to a large database of publicly available mitochondrial genomes. RtN! removes low-level sequencing noise and mitochondrial paralogs while not impacting variant calling, while competing methods were shown to remove true variants from mitochondrial mixtures. Availability and implementation https://github.com/Ahhgust/RtN Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals MONACO: accurate biological network alignment through optimal neighborhood matching between focal nodes

2020 ◽  
Author(s):  
Hyun-Myung Woo ◽  
Byung-Jun Yoon
Keyword(s):  
Biological Network ◽  
Protein Complexes ◽  
Ground Truth ◽  
Network Alignment ◽  
Supplementary Information ◽  
Alignment Algorithm ◽  
Computationally Efficient ◽  
Topological Similarity ◽  
Alignment Algorithms ◽  
Multiple Network

Abstract Motivation Alignment of protein–protein interaction networks can be used for the unsupervised prediction of functional modules, such as protein complexes and signaling pathways, that are conserved across different species. To date, various algorithms have been proposed for biological network alignment, many of which attempt to incorporate topological similarity between the networks into the alignment process with the goal of constructing accurate and biologically meaningful alignments. Especially, random walk models have been shown to be effective for quantifying the global topological relatedness between nodes that belong to different networks by diffusing node-level similarity along the interaction edges. However, these schemes are not ideal for capturing the local topological similarity between nodes. Results In this article, we propose MONACO, a novel and versatile network alignment algorithm that finds highly accurate pairwise and multiple network alignments through the iterative optimal matching of ‘local’ neighborhoods around focal nodes. Extensive performance assessment based on real networks as well as synthetic networks, for which the ground truth is known, demonstrates that MONACO clearly and consistently outperforms all other state-of-the-art network alignment algorithms that we have tested, in terms of accuracy, coherence and topological quality of the aligned network regions. Furthermore, despite the sharply enhanced alignment accuracy, MONACO remains computationally efficient and it scales well with increasing size and number of networks. Availability and implementation Matlab implementation is freely available at https://github.com/bjyoontamu/MONACO. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Whisper: Read sorting allows robust mapping of sequencing data

2017 ◽  
Author(s):  
Sebastian Deorowicz ◽  
Agnieszka Debudaj-Grabysz ◽  
Adam Gudyś ◽  
Szymon Grabowski
Keyword(s):  
Reference Genome ◽  
Variant Calling ◽  
Real Data ◽  
Supplementary Information ◽  
Sequencing Data ◽  
Suffix Arrays ◽  
Link Type ◽  
Mapping Tool ◽  
Reverse Complement ◽  
Comparable Accuracy

AbstractMotivationMapping reads to a reference genome is often the first step in a sequencing data analysis pipeline. Mistakes made at this computationally challenging stage cannot be recovered easily.ResultsWe present Whisper, an accurate and high-performant mapping tool, based on the idea of sorting reads and then mapping them against suffix arrays for the reference genome and its reverse complement. Employing task and data parallelism as well as storing temporary data on disk result in superior time efficiency at reasonable memory requirements. Whisper excels at large NGS read collections, in particular Illumina reads with typical WGS coverage. The experiments with real data indicate that our solution works in about 15% of the time needed by the well-known Bowtie2 and BWA-MEM tools at a comparable accuracy (validated in variant calling pipeline).AvailabilityWhisper is available for free from https://github.com/refresh-bio/Whisper or http://sun.aei.polsl.pl/REFRESH/Whisper/[email protected] informationSupplementary data are available at publisher Web site.

scholarly journals LRez: C ++ API and toolkit for analyzing and managing Linked-Reads data

2021 ◽  
Author(s):  
Pierre Morisse ◽  
Claire Lemaitre ◽  
Fabrice Legeai
Keyword(s):  
Genome Assembly ◽  
Low Cost ◽  
Variant Calling ◽  
Supplementary Information ◽  
Supplementary Data ◽  
High Quality ◽  
Dna Molecule ◽  
Sequencing Technologies ◽  
Wide Range ◽  
Genomic Regions

Abstract Motivation Linked-Reads technologies combine both the high-quality and low cost of short-reads sequencing and long-range information, through the use of barcodes tagging reads which originate from a common long DNA molecule. This technology has been employed in a broad range of applications including genome assembly, phasing and scaffolding, as well as structural variant calling. However, to date, no tool or API dedicated to the manipulation of Linked-Reads data exist. Results We introduce LRez, a C ++ API and toolkit which allows easy management of Linked-Reads data. LRez includes various functionalities, for computing numbers of common barcodes between genomic regions, extracting barcodes from BAM files, as well as indexing and querying BAM, FASTQ and gzipped FASTQ files to quickly fetch all reads or alignments containing a given barcode. LRez is compatible with a wide range of Linked-Reads sequencing technologies, and can thus be used in any tool or pipeline requiring barcode processing or indexing, in order to improve their performances. Availability and implementation LRez is implemented in C ++, supported on Unix-based platforms, and available under AGPL-3.0 License at https://github.com/morispi/LRez, and as a bioconda module. Supplementary information Supplementary data are available at Bioinformatics Advances

scholarly journals Pisces: An Accurate and Versatile Variant Caller for Somatic and Germline Next-Generation Sequencing Data

2018 ◽  
Author(s):  
Tamsen Dunn ◽  
Gwenn Berry ◽  
Dorothea Emig-Agius ◽  
Yu Jiang ◽  
Serena Lei ◽  
...  
Keyword(s):  
Next Generation Sequencing ◽  
Gene Mutations ◽  
Variant Calling ◽  
Amplicon Sequencing ◽  
Supplementary Information ◽  
Next Generation Sequencing Data ◽  
Next Generation ◽  
Sequencing Data ◽  
Ras Gene ◽  
Generation Sequencing

AbstractMotivationNext-Generation Sequencing (NGS) technology is transitioning quickly from research labs to clinical settings. The diagnosis and treatment selection for many acquired and autosomal conditions necessitate a method for accurately detecting somatic and germline variants, suitable for the clinic.ResultsWe have developed Pisces, a rapid, versatile and accurate small variant calling suite designed for somatic and germline amplicon sequencing applications. Pisces accuracy is achieved by four distinct modules, the Pisces Read Stitcher, Pisces Variant Caller, the Pisces Variant Quality Recalibrator, and the Pisces Variant Phaser. Each module incorporates a number of novel algorithmic strategies aimed at reducing noise or increasing the likelihood of detecting a true variant.AvailabilityPisces is distributed under an open source license and can be downloaded from https://github.com/Illumina/Pisces. Pisces is available on the BaseSpace™ SequenceHub as part of the TruSeq Amplicon workflow and the Illumina Ampliseq Workflow. Pisces is distributed on Illumina sequencing platforms such as the MiSeq™, and is included in the Praxis™ Extended RAS Panel test which was recently approved by the FDA for the detection of multiple RAS gene [email protected] informationSupplementary data are available online.

Sign in / Sign up

Export Citation Format

Share Document