Approximation algorithms for local alignment with length constraints

International Journal of Foundations of Computer Science

Volumn 13, Issue 5, 2002, Pages 751-767

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

^a University of California   (United States)

Author keywords

approximation algorithm; cyclic edit distance; edit distance; Local sequence alignment

Indexed keywords

EID: 10044274790     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054102001436     Document Type: Article

References (20)

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 and B. W. Erickson. Locally optimal subalignments using nonlinear similarity functions. Bulletin of Mathematical Biology, 48:633-660, 1986.
3. S. F. Altschul and B. W. Erickson. Significance levels for biological sequence comparison using nonlinear similarity functions. Bulletin of Mathematical Biology, 50:77-92, 1988.
4. 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.
5. A. N. Arslan, O. Egecioglu, and P. A. Pevzner. A new approach to sequence comparison: Normalized local alignment. Bioinformatics, 17(4):327-337, 2001.
6. H. Bunke and U. Biihler. Applications of approximate string matching to 2d shape recognition. Pattern Recognition, 26(12):1797-1812, 1993.
7. K-L. Chung. An improved algorithm for solving the banded cyclic string-to-string correction problem. Theoretical Computer Science, 201:275-279, 1998.
8. 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.
9. 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.
10. J. Gregor and M. G. Thomason. Efficient dynamic programming alignment of cyclic shifts by shift elimination. Pattern Recognition, 29(7): 1179-1185, 1996.
11. X. Huang and W. Miller. A time-efficient, linear-space local similarity algorithm. Advances in Applied Mathematics, 12:337-357, 1991.
12. G. M. Landau, E. W. Myers, and J. P. Schmidt. Incremental string comparison. Siam J. Comput., 27(2):557-582, 1998.
13. M. Maes. On a cyclic string-to-string correction problem. Information Processing Letters, 35:73-78, 1990.
14. T. F. Smith and M. S. Waterman. The identification of common molecular subsequences, J. of Molecular Biology, 147:195-197, 1981.
15. S. Uliel, A. Fliess, A. Amir, and R. Unger. A simple algorithm for detecting circular permutations in proteins. Bioinformatics, 15(ll):930-936, 1999.
16. R. A. Wagner and M. J. Fisher. The string-to-string correction problem. J. Assoc. Comput. Mach., 21(1):168-173, 1974.
17. M. S. Waterman. Introduction to computational biology. Chapman &Hall, 1995.
18. M. S. Waterman and M. Eggert A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons. J. Comput. Biol., 197:723-728, 1987.
19. Z. Zhang, P. Berman, and W. Miller. Alignments without low-scoring regions. J. Comput. Biol, 5:197-200, 1998.
20. Z. Zhang, P. Berman, T. Wiehe, and W. Miller. Post-processing long pairwise alignments. Bioinformatics, 15:1012-1019, 1999.