Algorithms for local alignment with length constraints

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

Volumn 2286, Issue , 2002, Pages 38-51

  Arslan, Abdullah N ^a   Eğgecioğlu, Ömer ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS;

DUAL APPROACH; EDIT DISTANCE; EFFICIENT APPROXIMATION ALGORITHMS; LENGTH CONSTRAINTS; LOCAL ALIGNMENT; LOCAL SEQUENCE ALIGNMENTS; POSITIVE INTEGERS; UPPER LIMITS;

ALIGNMENT;

EID: 84937439817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_9     Document Type: Conference Paper

References (15)

1. N. N. Alexandrov and V. V. Solovyev. Statistical significance of ungapped alignments. Pacific Symposium on Biocomputing (PSB-98), (eds. R. Altman, A. Dunker, L. Hunter, T. Klein), pages 463–472, 1998.
2. S. F. Altschul, T. L. Madden, A. A. Schaffer, J. Zhang, Z. Zhang, W. Miller, and D. J. Lipman. Gapped Blast and Psi-Blast: a new generation of protein database search programs. Nucleic Acids Research, 25:3389–3402, 1997.
3. A. N. Arslan, Ö. Eǧecioǧlu, and P. A. Pevzner. A new approach to sequence comparison: Normalized local alignment. Bioinformatics, 17(4):327–337, 2001.
4. H. Bunke and U. Bühler. Applications of approximate string matching to 2d shape recognition. Pattern Recognition, 26(12):1797–1812, 1993.
5. K-L. Chung. An improved algorithm for solving the banded cyclic string-to-string correction problem. Theoretical Computer Science, 201:275–279, 1998.
6. K. S. Fu and S. Y. Lu. Size normalization and pattern orientation problems in syntactics clustering. IEEE Trans. Systems Man Cybernet, 9:55–58, 1979.
7. J. W. Gorman, O. R. Mitchell, and F. P. Kuhl. Partial shape recognition using dynamic programming. IEEE Trans. Pattern Anal. Mech. Intell. PAMI-10, pages 257–266, 1988.
8. J. Gregor and M. G. Thomason. Efficient dynamic programming alignment of cyclic shifts by shift elimination. Pattern Recognition, 29(7):1179–1185, 1996.
9. G. M. Landau, E. W. Myers, and J. P. Schmidt. Incremental string comparison. Siam J. Comput., 27(2):557–582, 1998.
10. M. Maes. On a cyclic string-to-string correction problem. Information Processing Letters, 35:73–78, 1990.
11. T. F. Smith and M. S. Waterman. The identification of common molecular subsequences, J. of Molecular Biology, 147:195–197, 1981.
12. S. Uliel, A. Fliess, A. Amir, and R. Unger. A simple algorithm for detecting circular permutations in proteins. Bioinformatics, 15(11):930–936, 1999.
13. M. S. Waterman. Introduction to computational biology. Chapman & Hall, 1995.
14. Z. Zhang, P. Berman, and W. Miller. Alignments without low-scoring regions. J. Comput. Biol., 5:197–200, 1998.
15. Z. Zhang, P. Berman, T. Wiehe, and W. Miller. Post-processing long pairwise alignments. Bioinformatics, 15:1012–1019, 1999.