English
Related papers

Related papers: ReadsMap: a new tool for high precision mapping of…

200 papers

Huge numbers of short reads are being generated for mapping back to the genome to discover the frequency of transcripts, miRNAs, DNAase hypersensitive sites, FAIRE regions, nucleosome occupancy, etc. Since these reads are typically short…

Genomics · Quantitative Biology 2009-12-31 Peter J. Waddell , Timothy Herston

Due to the exponential growth of genomic data, constructing dedicated data structures has become the principal bottleneck in common bioinformatics applications. In particular, the Burrows-Wheeler Transform (BWT) is the basis of some of the…

Data Structures and Algorithms · Computer Science 2023-05-15 Francesco Masillo

Summary: Longer sequencing reads, with at least 200 bases per template are now common. While traditional aligners have adopted new strategies to improve the mapping of longer reads, aligners specific to bisulfite-sequencing were optimized…

Genomics · Quantitative Biology 2014-05-14 Brent S. Pedersen , Kenneth Eyring , Subhajyoti De , Ivana V. Yang , David A. Schwartz

High-throughput DNA sequencers are becoming indispensable in our understanding of diseases at molecular level, in marker-assisted selection in agriculture and in microbial genetics research. These sequencing instruments produce enormous…

Genomics · Quantitative Biology 2014-02-05 Saurabh Gupta , Sanjoy Chaudhury 'and' Binay Panda

Genome analysis fundamentally starts with a process known as read mapping, where sequenced fragments of an organism's genome are compared against a reference genome. Read mapping is currently a major bottleneck in the entire genome analysis…

Hardware Architecture · Computer Science 2020-10-29 Mohammed Alser , Zülal Bingöl , Damla Senol Cali , Jeremie Kim , Saugata Ghose , Can Alkan , Onur Mutlu

Pairwise alignment of DNA sequencing data is a ubiquitous task in bioinformatics and typically represents a heavy computational burden. State-of-the-art approaches to speed up this task use hashing to identify short segments (k-mers) that…

Machine Learning · Computer Science 2021-02-16 Govinda M. Kamath , Tavor Z. Baharav , Ilan Shomorony

With the increasing affordability and accessibility of genome sequencing data, de novo genome assembly is an important first step to a wide variety of downstream studies and analyses. Therefore, bioinformatics tools that enable the…

Genomics · Quantitative Biology 2023-06-09 Lauren Coombe , René L. Warren , Johnathan Wong , Vladimir Nikolic , Inanc Birol

Genome sequence analysis has enabled significant advancements in medical and scientific areas such as personalized medicine, outbreak tracing, and the understanding of evolution. Unfortunately, it is currently bottlenecked by the…

Motivations Short-read accuracy is important for downstream analyses such as genome assembly and hybrid long-read correction. Despite much work on short-read correction, present-day correctors either do not scale well on large data sets or…

Data Structures and Algorithms · Computer Science 2020-04-08 Antoine Limasset , Jean-Francois Flot , Pierre Peterlongo

Motivation: Seed location filtering is critical in DNA read mapping, a process where billions of DNA fragments (reads) sampled from a donor are mapped onto a reference genome to identify genomic variants of the donor. State-of-the-art read…

Advances in DNA sequencing technology have stimulated the development of algorithms and tools for processing very large collections of short strings (reads). Short-read alignment and assembly are among the most well-studied problems. Many…

Genomics · Quantitative Biology 2014-01-30 Chi-Man Liu , Ruibang Luo , Tak-Wah Lam

In this paper we introduce a novel parallel pipeline for fast and accurate mapping of RNA sequences on servers equipped with multicore processors. Our software, named HPG-Aligner, leverages the speed of the Burrows-Wheeler Transform to map…

Summary: BWA-MEM is a new alignment algorithm for aligning sequence reads or long query sequences against a large reference genome such as human. It automatically chooses between local and end-to-end alignments, supports paired-end reads…

Genomics · Quantitative Biology 2013-05-28 Heng Li

The tremdendous advances in high-throughput sequencing technologies have made population-scale sequencing as performed in the 1000 Genomes project and the Genome of the Netherlands project possible. Next-generation sequencing has allowed…

Genomics · Quantitative Biology 2013-03-15 Tobias Marschall , Alexander Schönhuth

Motivation: Seed filtering is critical in DNA read mapping, a process where billions of DNA fragments (reads) sampled from a donor are mapped onto a reference genome to identify genomic variants of the donor. Read mappers 1) quickly…

DNA sequence alignment involves assigning short DNA reads to the most probable locations on an extensive reference genome. This process is crucial for various genomic analyses, including variant calling, transcriptomics, and epigenomics.…

Aligning reads to a reference sequence is a fundamental step in numerous bioinformatics pipelines. As a consequence, the sensitivity and precision of the mapping tool, applied with certain parameters to certain data, can critically affect…

Genomics · Quantitative Biology 2016-03-17 Karel Břinda , Valentina Boeva , Gregory Kucherov

The advent of high-throughput sequencing technologies constituted a major advance in genomic studies, offering new prospects in a wide range of applications. We propose a rigorous and flexible algorithmic solution to mapping SOLiD…

Quantitative Methods · Quantitative Biology 2011-01-18 Laurent Noé , Marta L. Gîrdea , Gregory Kucherov

It is known that the exact form of the Burrows-Wheeler-Transform (BWT) of a string collection depends, in most implementations, on the input order of the strings in the collection. Reordering strings of an input collection affects the…

Data Structures and Algorithms · Computer Science 2022-12-05 Davide Cenzato , Veronica Guerrini , Zsuzsanna Lipták , Giovanna Rosone

Some recent results have introduced external-memory algorithms to compute self-indexes of a set of strings, mainly via computing the Burrows-Wheeler Transform (BWT) of the input strings. The motivations for those results stem from…

Data Structures and Algorithms · Computer Science 2015-06-12 Paola Bonizzoni , Gianluca Della Vedova , Yuri Pirola , Marco Previtali , Raffaella Rizzi