Near optimal multiple alignment within a band in polynomial time

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 425-434

  Li, Ming ^a   Ma, Bin ^a   Wang, Lusheng ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL BIOLOGY; CONSENSUS ALIGNMENT; MULTIPLE ALIGNMENT; MULTIPLE SEQUENCE ALIGNMENTS; MULTIPLE SEQUENCES; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME; STANDARD MODEL; MULTIPLE SEQUENCE ALIGNMENT;

BIOINFORMATICS; POLYNOMIAL APPROXIMATION; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY;

COMPUTATION THEORY; POLYNOMIALS;

EID: 0033726517     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335354     Document Type: Conference Paper

References (25)

1. S. Altschul and D. Lipman, Trees, stars, and multiple sequence alignment, SIAM J. Appl. Math. 49, pp. 197-209, 1989.
2. V. Bafna, E. Lawler and P. Pevzner, Approximation algorithms for multiple sequence alignment, Proc. 8th Ann. Combinatorial Pattern Matching Conf., pp. 43-53, 1994.
3. K. Chao, W. R. Pearson and W. Miller, Aligning two sequences within a specified diagonal band, CABIOS, 8, pp. 481-487, 1992.
4. D. Gusfield, Efficient methods for multiple sequence alignment with guaranteed error bounds, Bull. Math. Biol., 30, pp. 141-154, 1993.
5. D. Gusfield, Algorithms on strings, trees, and sequences, Cambridge Univ. Press, 1997.
6. J. W. Fickett, Fast optimal alignment, Nucleic Acids Res., 12, 175-180, 1984.
7. W. Just, On the computational complexity of gap-0 multiple alignment, manuscript, 1998.
8. J. Keceeioglu, H-P. Lenhof, K. Mehlhom, P. Mutzel, K. Reinert, M. Vingron, A polyhedral approach to sequence alignment problems. To appear in Disc. Appl. Math., special issue on Computational Biology, Ed. P. Pevzner, 1999.
9. M. Li, B. Ma, and L. Wang, Finding similar regions in many sequences, Proc. 31st ACM Syrup. Theory of Computing, 473-482, Atlanta, 1999.
10. R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press, 1995.
11. G. Myers, S. Selznick, Z. Zhang, W. Miller, Progressive multiple alignment with constraints, 1st Ann. Int'l Conf. Comput. Mol. Biol., pp. 220-225, 1997.
12. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43, 425-440, 1991
13. W. R. Pearson and D. Lipman, Improved tools for biological sequence comparison, Proc. Natl. Acad. Sci. USA, 85, pp. 2444-2448, 1988.
14. W. R. Pearson, Rapid and sensitivecomparison with FASTP and FASTA, Methods Enzymol., 183, pp. 63-98, 1990.
15. W. R. Pearson, Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms, Genomics, 11, pp. 635-650, 1991.
16. P. Pevzner, Multiple alignment, communication cost, and graph matching, SIAM J. Appl. Math., 52, pp. 1763-1779, 1992. (Pubitemid 23586485)
17. D. Sankoff and J. Kruskal, Time warps, string edits, and macromolecules: the theory and practice of sequence comparison, Addison Wesley, 1983.
18. J. L. Spouge, Fast optimal alignment, CABIOS, 7, pp. 1-7, 1991.
19. C. J. Stone, A Course in Probability and Statistics, Duxbury Press, 1995.
20. E. Ukkonen, Algorithms for approximate string matching, Inform. Control, 64, pp. 100-118, 1985.
21. L. Wang and T. Jiang, On the complexity of multiple sequence alignment, J. Comp. Biol., 1, pp. 337-348, 1994.
22. L. Wang, T. Jiang and E. L. Lawler, Approximation algorithms for tree alignment with a given phylogeny, Algorithmica, 16, pp. 302-315, 1996. (Pubitemid 126418830)
23. L. Wang and D. Gusfield, Improved approximation algorithms for tree alignment, J. Alg., 25, pp. 255-273, 1997. (Pubitemid 127451764)
24. M. S. Waterman, Introduction to computational biology, Chapman & Hall, 1995.
25. B. Y. Wu, G. Lancia, V. Bafna, K. Chao, R. Ravi, C. Y. Tang, A polynomial time approximation scheme for minimum routing cost spanning trees, Proc. 9th ACM-SIAM Symp. Disc. Alg., pp. 21-32, 1998.