Fast mapping of short sequences with mismatches, insertions and deletions using index structures

PLoS Computational Biology

Volumn 5, Issue 9, 2009, Pages

  Hoffmann, Steve ^a   Otto, Christian ^a   Kurtz, Stefan ^b   Sharma, Cynthia M ^c   Khaitovich, Philipp ^h   Vogel, Jörg ^c   Stadler, Peter F ^a,d,e,f,g   Hackermüller, Jörg ^d  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b UNIVERSITY OF HAMBURG   (Germany)

^c MAX PLANCK INSTITUTE FOR INFECTION BIOLOGY   (Germany)

^d FRAUNHOFER INSTITUTE FOR CELL THERAPY AND IMMUNOLOGY   (Germany)

^e SANTA FE INSTITUTE   (United States)

^f UNIVERSITY OF VIENNA   (Austria)

^g MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

^h MAX PLANCK INSTITUTE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ERRORS; HEURISTIC METHODS; RNA;

'CURRENT; ERROR MODELING; ILLUMINA; INDEX STRUCTURE; INSERTIONS AND DELETIONS; MATCHING MODELS; SHORT READS; SHORT SEQUENCES; SHORT-READ MAPPINGS; SIMPLE++;

MAPPING;

DNA; MICRORNA; POLYADENYLATED RNA; SMALL INTERFERING RNA;

ARTICLE; COMPARATIVE STUDY; COMPUTER PROGRAM; DNA SEQUENCE; ERROR; GENE DELETION; GENE INSERTION; GENE MAPPING; GENETIC ALGORITHM; HUMAN; INDEL MUTATION; NONHUMAN; PYROSEQUENCING; RNA SEQUENCE; SCORING SYSTEM; SENSITIVITY AND SPECIFICITY; SEQUENCE ALIGNMENT; THEORETICAL MODEL; ALGORITHM; BIOLOGY; METHODOLOGY; MUTATION; NUCLEOTIDE SEQUENCE;

ALGORITHMS; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; DNA MUTATIONAL ANALYSIS; MUTATION; SEQUENCE ALIGNMENT;

EID: 70349667200     PISSN: 1553734X     EISSN: 15537358     Source Type: Journal    
DOI: 10.1371/journal.pcbi.1000502     Document Type: Article

References (17)

1. Myers G (1999) A fast bit-vector algorithm for approximate string matching based on dynamic programming. J ACM 46: 395-415.
2. Abouelhoda MI, Kurtz S, Ohlebusch E (2004) Replacing suffix trees with enhanced suffix arrays. J Discr Algorithms 2: 53-86.
3. Rothberg JM, Leamon JH (2008) The development and impact of 454 sequencing. Nat Biotechnol 26: 1117-1124.
4. Bennett S (2004) Solexa Ltd. Pharmacogenomics 5: 433-438.
5. Huse S, Huber J, Morrison H, Sogin M, Welch D (2007) Accuracy and quality of massively parallel DNA pyrosequencing. Genome Biology 8: R143. (Pubitemid 351903194)
6. Dohm JC, Lottaz C, Borodina T, Himmelbauer H (2008) Substantial biases in ultra-short read data sets from high-throughput DNA sequencing. Nucl Acids Res 36: e105.
7. Li H, Ruan J, Durbin R (2008) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res 18: 1851-1858
8. Li R, Li Y, Kristiansen K, Wang J (2008) SOAP: short oligonucleotide alignment program. Bioinformatics 24: 713-714. (Pubitemid 351321217)
9. Rumble SM, Lacroute P, Dalca AV, Fiume M, Sidow A, et al. (2009) SHRiMP: Accurate mapping of short color-space reads. PLoS Comput Biol 5: e1000386.
10. Lin H, Zhang Z, Zhang MQ, Ma B, Li M (2008) ZOOM! Zillions of oligos mapped. Bioinformatics 24: 2431-2437.
11. Langmead B, Trapnell C, Pop M, Salzberg SL (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biology 10: R25.
12. Prüfer K, Stenzel U, Dannemann M, Green RE, Lachmann M, et al. (2008) PatMaN: rapid alignment of short sequences to large databases. Bioinformatics 24: 1530-1531. (Pubitemid 351911705)
13. Li H, Durbin R (2009) Fast and Accurate Read Alignment with Burrows- Wheeler Transform. Bioinformatics 25: 1754-1760.
14. Karlin S, Altschul SF (1990) Methods for assessing the statistical significance of molecular sequences features by using general scoring schemes. Proc Natl Acad Sci USA 87: 2264-2268. (Pubitemid 20105297)
15. Ferragina P, Manzini G (2000) Opportunistic data structures with applications. In: IEEE Symposium on Foundations of Computer Science. pp 390-398.
16. Chang W, Lawler E (1994) Sublinear approximate string matching and biological applications. Algorithmica 12: 327-344.
17. Crochemore M, Hancart C, Lecroq T (2007) Algorithms on Strings. Cambridge University Press.