A random-permutations-based approach to fast read alignment
Author:
Open Access
- 10 April 2013
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 14 (S5) , 1-S8
Abstract
Read alignment is a computational bottleneck in some sequencing projects. Most of the existing software packages for read alignment are based on two algorithmic approaches: prefix-trees and hash-tables. We propose a new approach to read alignment using random permutations of strings.Keywords
This publication has 16 references indexed in Scilit:
- Tools for mapping high-throughput sequencing dataBioinformatics, 2012
- Fast gapped-read alignment with Bowtie 2Nature Methods, 2012
- Randomized approximate nearest neighbors algorithmProceedings of the National Academy of Sciences, 2011
- A map of human genome variation from population-scale sequencingNature, 2010
- mrsFAST: a cache-oblivious algorithm for short-read mappingNature Methods, 2010
- A survey of sequence alignment algorithms for next-generation sequencingBriefings in Bioinformatics, 2010
- Personalized copy number and segmental duplication maps using next-generation sequencingNature Genetics, 2009
- SOAP2: an improved ultrafast tool for short read alignmentBioinformatics, 2009
- Fast and accurate short read alignment with Burrows–Wheeler transformBioinformatics, 2009
- Finishing the euchromatic sequence of the human genomeNature, 2004