Dynamic programming based approximation algorithms for sequence alignment with constraints

INFORMS Journal on Computing

Volumn 16, Issue 4, 2004, Pages 441-458

  Arslan, Abdullah N ^a,b   Eǧecioǧlu, Ömer ^a,b  

^a University of Vermont   (United States)

^b University of California   (United States)

Author keywords

Approximation algorithm; Cyclic sequence comparison; Dynamic programming; Fractional programming; Length restricted local alignment; Local alignment; Normalized local alignment; Ratio maximization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; CYCLIC SEQUENCE COMPARISON; FRACTIONAL PROGRAMMING; LENGTH-RESTRICTED LOCAL ALIGNMENT; LOCAL ALIGNMENT; NORMALIZED LOCAL ALIGNMENT; RATIO MAXIMIZATION;

DYNAMIC PROGRAMMING;

EID: 10044230392     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0097     Document Type: Article

References (25)

1. Altschul, S., W. Gish. 1996. Local alignment statistics. Methods Enzymology 266 460-480.
2. Altschul, S., W. Gish, W. Miller, E. Myers, J. Lipman. 1990. Basic local alignment search tool. J. Molecular Biol. 215 413-410.
3. Altschul, S., T. L. Madden, A. A. Schaffer, J. Zhang, Z. Zhang, W. Miller, D. J. Lipman. 1997. Gapped Blast and Psi-Blast: A new generation of protein database search programs. Nucleic Acids Res. 25 3389-3402.
4. Arslan, A. N., Ö. Eǧecioǧlu. 2001. An improved upper bound on the size of planar convex-hulls. Proc. Seventh Internat. Comput. Combin. Conf. (COCOON'01), Guilin, China, Lecture Notes in Computer Science, No. 2108, Springer-Verlag, Heidelberg, Germany, 111-120.
5. Arslan, A. N., Ö. Eǧecioǧlu. 2002. Approximation algorithms for local alignment with length constraints. Internat. J. Foundations Comput. Sci. 13 751-767.
6. Arslan, A. N., Ö. Eǧecioǧlu, P. A. Pevzner. 2001. A new approach to sequence comparison: normalized local alignment. Bioinformatics 17 327-337.
7. Bunke, H., U. Bühler. 1993. Applications of approximate string matching to 2d shape recognition. Pattern Recognition 26 1797-1812.
8. Cormen, T. H., C. E. Leiserson, R. L. Rivest, C. Stein. 2001. Introduction to Algorithms, 2nd ed. The MIT Press, Cambridge, MA.
9. Craven, B. D. 1988. Fractional Programming. Helderman Verlag, Berlin, Germany.
10. Fitch, W. M., T. F. Smith. 1983. Optimal sequence alignments. Proc. Natl. Acad. Sci. USA 80 1382-1386.
11. Goad, W. B., M. I. Kanehisa. 1982. Pattern recognition in nucleic acid sequences, I: A general method for finding local homologies and symmetries. Nucleic Acid Res. 10 247-163.
12. Gusfield, D. 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. The Press Syndicate of The University of Cambridge, New York.
13. Gusfield, D., K. Balasubramanian, D. Naor. 1994. Parametric optimization of sequence alignment. Algorithmica 12 312-326.
14. Huang, X., P. A. Pevzner, W. Miller. 1994. Parametric recomputing in alignment graph. Proc. Fifth Annual Sympos. Combin. Pattern Matching, Asilomar, California, Lecture Notes in Computer Science, No. 807, Springer-Verlag, Hedeilberg, Germany, 87-101.
15. Lin, Y. L., T. Jiang, K. M. Chao. 2002. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. System Sci. 65 570-586.
16. Lipman, D. J., W. R. Pearson. 1985. Rapid and sensitive protein searches. Science 227 1435-1441.
17. Macs, M. 1990. On a cyclic string-to-string correction problem. Inform. Processing Lett. 35 73-78.
18. Megiddo, N. 1979. Combinatorial optimization with rational objective functions. Math. Oper. Res. 4 414-424.
19. Sellers, P. H. 1984. Pattern recognition in genetic sequences by mismatch density. Bull. Math. Biol. 46 501-504.
20. Smith, T. F., M. S. Waterman. 1981. The identification of common molecular subsequences. J. Molecular Biol. 147 195-197.
21. Sniedovich, M. 1992. Dynamic Programming. Marcel Dekker, New York.
22. Uliel, S-, A. Fliess, A. Amir, R. Unger. 1999. A simple algorithm for detecting circular permutations in proteins. Bioinformatics 15 930-936.
23. Waterman, M. S. 1995. Introduction to Computational Biology. Chapman & Hall, London, U.K.
24. Zhang, Z., P. Berman, W. Miller. 1998. Alignments without low-scoring regions. J. Comput. Biol. 5 197-200.
25. Zhang, Z., P. Berman, T. Wiehe, W. Miller. 1999. Post-processing long pairwise alignments. Bioinformatics 15 1012-1019.