Read mapping algorithms for single molecule sequencing data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5251 LNBI, Issue , 2008, Pages 38-49

  Yanovsky, Vladimir ^a   Rumble, Stephen M ^a   Brudno, Michael ^a,b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT ALGORITHMS; CANDIDATE LOCATIONS; ERROR RATES; FAST IMPLEMENTATIONS; FILTERING METHODS; MAPPING ALGORITHMS; MATCHING PROCESSES; OPTIMAL ALIGNMENTS; SEQUENCE GRAPHS; SINGLE MOLECULE SEQUENCING; SPACED SEEDS;

ALGORITHMS; ALIGNMENT; BIOINFORMATICS; COMBINES; DNA; GENES; LOCATION; MOLECULES; NUCLEIC ACIDS; ORGANIC ACIDS; TECHNICAL PRESENTATIONS;

CONFORMAL MAPPING;

EID: 56649121826     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87361-7_4     Document Type: Conference Paper

References (13)

1. Califano, A., Rigoutsos, I.: Flash: A fast look-up algorithm for string homology. In: Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology, pp. 56-64. AAAI Press, Menlo Park (1993)
2. Chenna, R., Sugawara, H., Koike, T., Lopez, R., Gibson, T.J., Higgins, D.G., Thompson, J.D.: Multiple sequence alignment with the clustal series of programs. Nucleic Acids Res. 31(13), 3497-3500 (2003)
3. Jettand, J.H., et al.: High-speed DNA sequencing: an approach based upon fluorescence detection of single molecules. Journal of biomolecular structure and dynamics 7(2), 301-309 (1989)
4. Harris, T.D., et al.: Single-molecule DNA sequencing of a viral genome. Science 320(5872), 106-109 (2008)
5. Farrar, M.: Striped Smith-Waterman speeds database searches six times over other SIMD implementations. Bioinformatics 23(2), 156-161 (2007)
6. Hein, J.: A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given. Molecular Biology and Evolution 6(6), 649-668 (1989)
7. Naor, D., Brutlag, D.L.: On near-optimal alignments of biological sequences. Journal of Computational Biology 1(4), 349-366 (1994)
8. Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequences of two proteins. JMB 48, 443-453 (1970)
9. Rasmussen, K.R., Stoye, J., Myers, E.W.: Efficient q-gram filters for finding all epsilon-matches over a given length. Journal of Computational Biology 13(2), 296-308 (2006)
10. Rognes, T., Seeberg, E.: Six-fold speed-up of smith-waterman sequence database searches using parallel processing on common microprocessors. Bioinformatics 16(8), 699-706 (2000)
11. Schwikowski, B., Vingron, M.: Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions. Discrete Appl. Math. 127(1), 95-117 (2003)
12. Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology 147, 195-197 (1981)
13. Wozniak, A.: Using video-oriented instructions to speed up sequence comparison. Computer Applications in the Biosciences 13(2), 145-150 (1997)