Alignment of biological sequences with quality scores

International Journal of Bioinformatics Research and Applications

Volumn 5, Issue 1, 2009, Pages 97-113

  Joong, Chae Na ^a   Roh, Kangho ^b   Apostolico, Alberto ^c,d   Park, Kunsoo ^e  

^a Sejong University   (South Korea)

^b SAMSUNG Electronics   (South Korea)

^c UNIVERSITY OF PADOVA   (Italy)

^d Georgia Institute of Technology   (United States)

^e Seoul National University   (South Korea)

Author keywords

Bioinformatics; DNA sequence; Quality score; Sequence alignment

Indexed keywords

ALGORITHM; ARTICLE; BIOENGINEERING; BIOINFORMATICS; DNA SEQUENCE; GENE MAPPING; PROBABILITY; QUALITY CONTROL; SEQUENCE ALIGNMENT;

EID: 58149216434     PISSN: 17445485     EISSN: 17445493     Source Type: Journal    
DOI: 10.1504/IJBRA.2009.022466     Document Type: Article

References (29)

1. Apostolico, A. and Giancarlo, R. (1998) 'Sequence alignment in molecular biology', Journal of Computational Biology, Vol. 5, No. 2, pp.173-196.
2. Apostolico, A. and Guerra, C. (1987) 'The longest common subsequence problem revisited', Algorithmica, Vol. 2, pp.315-336.
3. Arslan, A.N., Eǧecioǧlu, O. and Pevzner, P.A. (2001) 'A new approach to sequence comparison: normalized sequence alignment', Bioinformatics, Vol. 17, No. 4, pp.327-337.
4. Benson, G. (1997) 'Sequence alignment with tandem duplication', Proceedings of the First Annual Int. Conf. on Computational Molecular Biology (RECOMB-97), pp.27-36.
5. Crochemore, M., Landau, G.M. and Ziv-Ukelson, M. (2002) 'A sub-quadratic sequence alignment algorithm for unrestricted cost matrices', Proceedings of the 13th ACM-SIAM Symp. on Discrete Algorithms, pp.679-688.
6. Ewing, B., Hillier, L., Wendl, M.C. and Green, P. (1998) 'Base-calling of automated sequencer traces using phred. I. Accuracy assessment', Genome Research, Vol. 8, No. 3, pp.175-185.
7. Feng, D. and Doolittle, R. (1987) 'Progressive sequence alignment as a prerequisite to correct phylogenetic trees', Journal of Molecular Evolution, Vol. 25, pp.351-360.
8. Fitch, W.M. and Smith, T.F. (1983) 'Optimal sequence alignments', Proceedings of the National Academy of Sciences USA, Vol. 80, pp.1382-1386.
9. Galil, Z. and Giancarlo, R. (1988) 'Data structures and algorithms for approximate string matching', Journal of Complexity, Vol. 4, No. 1, pp.33-72.
10. Gotoh, O. (1982) 'An improved algorithm for matching biological sequences', Journal of Molecular Biology, Vol. 162, No. 3, pp.705-708.
11. Green, P. (1995) Documentation for Phrap, Genome Center, University of Washington, http://www.phrap.org/phrap.docs/phrap.html
12. Gusfield, D. (1983) 'Parametric combinatorial computing and a problem of program module distribution', Journal of the ACM, Vol. 30, No. 3, pp.551-563.
13. Gusfield, D. (1993) 'Efficient methods for multiple sequence alignment with guaranteed error bounds', Bulletin of Mathematical Biology, Vol. 55, No. 1, pp.141-154.
14. Gusfield, D. (1997) Algorithms on Strings, Tree, and Sequences, Cambridge University Press, Cambridge.
15. Hirschberg, D.S. and Larmore, L.L. (1989) 'The set-set LCS problem', Algorithmica, Vol. 4, No. 4, pp.503-510.
16. Hubbard, T.J., Lesk, A.M. and Tramontano, A. (1996) 'Gathering them into the fold', Nature Structural Biology, Vol. 4, p.313.
17. Myers, G. (1991) An Overview of Sequence Comparison Algorithms in Molecular Biology, Technical Report TR-91-29, Dept. of Computer Science, University of Arizona.
18. Myers, G. (1994) Computational Methods in Genome Research, Plenum Press, New York, Chapter Algorithmic Advances for Searching Biosequence Databases, pp.121-135.
19. Navarro, G. (2001) 'A guided tour to approximate string matching', ACM Computing Surveys, Vol. 33, No. 1, pp.31-88.
20. Needleman, S.B. and Wunsch, C.D. (1970) 'A general method applicable to the search for similarities in the amino acid sequences of two proteins', Journal of Molecular Biology, Vol. 48, No. 3, pp.443-453.
21. Pevzner, P.A. (2000) Computational Molecular Biology: An Algorithmic Approach, The MIT Press, Cambridge.
22. Rice, P., Longden, I. and Bleasby, A. (2000) 'Emboss: the european molecular biology open software suite', Trends in Genetics, Vol. 16, No. 6, pp.276-277.
23. Sankoff, D. and Kruskal, J. (1983) Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, MA.
24. Smith, T.F. and Waterman, M.S. (1981) 'Identification of common molecular subsequences', Journal of Molecular Biology, Vol. 147, No. 1, pp.195-197.
25. Wagner, R. and Fischer, M. (1974) 'The string to string correction problem', Journal of the ACM, Vol. 21, No. 1, pp.168-173.
26. Wang, B.F., Chen, G.H. and Park, K. (1993) 'On the set LCS and set-set LCS problems', Journal of Algorithms, Vol. 14, No. 3, pp.466-477.
27. Waterman, M.S. (1984) 'Efficient sequence alignment algorithms', Journal of Theoretical Biology, Vol. 108, pp.333-337.
28. Waterman, M.S. (1995) Introduction to Computational Biology: Sequences, Maps and Genomes, Chapman & Hall/CRC, London.
29. Zhang, Z., Berman, P., Wiehe, T. and Miller, W. (1999) 'Post-processing long pairwise alignments', Bioinformatics, Vol. 15, No. 12, pp.1012-1019.