Error tolerant indexing and alignment of hort reads with covering template families

Journal of Computational Biology

Volumn 17, Issue 10, 2010, Pages 1279-1293

  Giladi, Eldar ^a   Healy, John ^a   Myers, Gene ^b   Hart, Chris ^c   Kapranov, Philipp ^a   Lipson, Doron ^a   Roels, Steve ^a   Thayer, Edward ^d   Letovsky, Stan ^a  

^a Helicos BioSciences Corporation   (United States)

^b Janelia Farm Research Campus ^*  (United States)

^c NEW COLLEGE OF FLORIDA   (United States)

^d MICROSOFT   (United States)

Author keywords

filtration; gapped q gram; gapped seed; multiple spaced seeds; sequence similarity; string matching

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; DNA SEQUENCE; DNA TEMPLATE; MOLECULAR GENETICS; NUCLEOTIDE SEQUENCE; SEQUENCE ALIGNMENT;

ALGORITHMS; BASE SEQUENCE; MOLECULAR SEQUENCE DATA; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE; TEMPLATES, GENETIC;

EID: 77958062930     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2010.0005     Document Type: Article

References (30)

1. Altschul, S., Madden, T., Schäffer, A., et al. 1997. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res. 25, 3389-3402.
2. Brejova, B., Brown, D., and Vinar, T. 2003. Vector seeds: an extension to spaced seeds allows substantial improvements in sensitivity and specificity. Proc. 3rd Int. WABI 39-54.
3. Brown, D. G. 2004. Multiple vector seeds for protein alignment. Proc. 4th Int. WABI 170-181.
4. Buhler, J. 2001. Efficient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics 17, 419-428.
5. Buhler, J., Keich, U., and Sun, Y. 2003. Designing seeds for similarity search in genomic DNA. Proc. RECOMB 2003 67-75.
6. Burkhardt, S., and Kärkkäinen, J. 2003. Better filtering with gapped q-grams. Fund. Inform. 56, 51-70.
7. Burkhardt, S., and Kärkkäinen, J. 2002. One-gapped q-gram filters for Levenshtein distance. Proc. 13th Annu. Symp. Combin. Patt. Match.
8. Califano, A., and Rigoutsos, I. 1993. Flash: A Fast Look-up Algorithm for String Homology. 1st Int. Conf. Intell. Syst. Mol. Biol. 56-64.
9. Choi, K., and Zhang, L. 2004. Sensitivity analysis and efficient method for identifying optimal spaced seeds. J. Comput. Syst. Sci. 68, 22-40.
10. Harris, T. D., Buzby, P. R., Babcock, H., et al. 2008. Single-molecule DNA sequencing of a viral genome. Science 320, 106-109.
11. Johnson, D. S., Mortazavi, A., Myers, R. M., et al. 2007. Genome-wide mapping of in vivo protein-DNA interactions. Science 316, 1497-1502.
12. Kaiser, J. 2008. DNA sequencing. A plan to capture human diversity in 1000 genomes. Science 319.
13. Keich, U., Li, M., Ma, B., et al. 2004. On spaced seeds for similarity search. Discrete Appl. Math 138, 253-263.
14. Kent, J. W. 2002. BLAT-The BLAST-like alignment tool. Genome Res. 12, 656-664.
15. Kucherov, G., Noé, L., and Roytberg, M. 2005. Multiseed lossless filtration. IEEE/ACM Trans. Comput. Biol. Bioinform. 2, 51-61.
16. Kucherov, G., Noé, L., and Ponty, Y. 2004. Estimating seed sensitivity on homogeneous alignments. IEEE 4th Symp. BIBE 2004.
17. Li, H., Ruan, J., and Durbin, R. 2008. Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res. 18, 1851-1858.
18. Li, M., Ma, B., Kisman, D., et al. 2004. PatternHunter II: highly sensitive and fast homology search. J. Bioinform. Comput. Biol. 2, 417-440.
19. Lipson, D., Raz, T., Kieu, A., et al. 2009. Quantification of the yeast transcriptome by single-molecule sequencing. Nat. Biotechnol. 27, 652-658.
20. Ma, B., Tromp, J., and Li, M. 2002. PatternHunter: faster and more sensitive homology search. Bioinformatics 18, 440-445.
21. Mosaik. http://bioinformatics.bc.edu/marthlab/mosaik
22. Myers, G. 1999. A fast bit-vector algorithm for approximate string matching based on dynamic progamming. J. ACM 46, 395-415.
23. Noé, L., and Kucherov, G. 2004. Improved hit criteria for DNA local alignment. BMC Bioinform. 5.
24. Pevzner, P., and Waterman, M. 1995. Multiple filtration and approximate pattern matching. Algorithmica 13, 135-154.
25. Rumble, S. M., Lacroute, P., Dalca, A. V., et al. 2009. SHRiMP: accurate mapping of short color-space reads. PLOS Comput. Biol. 5.
26. Schwartz, S., Kent, J., Smit, A., et al. 2003. Human-mouse alignments with BLASTZ. Genome Res. 13, 103-107.
27. Stromberg, M. 2009. Mosaik assembler.
28. Sun, Y., and Buhler, J. 2004. Designing multiple simultaneous seeds for DNA similarity search. Proc. RECOMB 2004 76-84.
29. Wang, J., Wang, W., Li, R., et al. 2008. The diploid genome sequence of an Asian individual. Nature 456, 60-65.
30. Xu, J., Brown, D., Li, M., et al. 2004. Optimizing multiple spaced seeds for homology search. 15th Symp. Combin. Patt. Match. 47-58.