Approximation algorithms for multiple sequence alignment

Theoretical Computer Science

Volumn 182, Issue 1-2, 1997, Pages 233-244

  Bafna, Vineet ^a   Lawler, Eugene L ^b   Pevzner, Pavel A ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING;

MULTIPLE SEQUENCE ALIGNMENT;

COMPUTATION THEORY;

EID: 0031207582     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00023-6     Document Type: Article

References (21)

1. S.F. Altschul, D.J. Lipman, Trees, stars, and multiple biological sequence alignment, SIAM J. Appl. Math. 49 (1989) 197-209.
2. V. Bafna, E.L. Lawler, P. Pevzner, Approximation Algorithms for Multiple Sequence Alignment, in: Proc. of the 5th Annual Symp. on Combin. Pattern Matching (CPM'94). Lecture Notes in Computer Science, vol. 807, Springer, Berlin, 1994, pp. 43-53.
3. Z. Baranyai, On the factorization of the complete uniform hypergraph, in: A. Hajnal, T. Rado, V.T. Sós (Eds.), Infinite and Finite Sets, North-Holland, Amsterdam, 1975, pp. 91-108.
4. J. Bósak, Decompositions of Graphs, Kluwer, Dordrecht, 1990.
5. J.L. Carter, M.N. Wegman, Universal classes of hash functions, J. Comput. System Sci. 18 (1979) 143-154.
6. S.C. Chan, A.K.C. Wong, D.K.Y. Chiu, A survey of multiple sequence comparison methods, Bull. Math. Biol. 54 (1992) 563-598.
7. D. Feng, R. Doolittle, Progressive sequence alignment as a prerequisite to correct phylogenetic trees, J. Molec. Evol. 25 (1987) 351-360.
8. A.E. Gorbalenya, V.M. Blinov, A.P. Donchenko, E.V. Koonin, An NTP-binding motif is the most conserved sequence in a highly diverged monophyletic group of proteins involved in positive strand RNA viral replication. J. Molec. Evol. 28 (1989) 256-68.
9. D. Gusfield, Efficient methods for multiple sequence alignment with guaranteed error bounds, Tech. Report, Computer Science Division, University of California, Davis, CSE-91-4, 1991.
10. D. Gusfield, Efficient methods for multiple sequence alignment with guaranteed error bounds, Bulletin of Mathematical Biology 55 (1993) 141-154.
11. T. Jiang, E.L. Lawler, L. Wang, Aligning sequences via an evolutionary tree: complexity and approximation, in: Proc. ACM STOC'94, 1994, pp. 760-769.
12. J. Kececioglu, The maximum weight trace alignment problem in multiple sequence alignment, in: A. Apostolico, M. Crochemore, Z. Galil, U. Manber (Eds.), Combinatorial Pattern Matching 93, Padova, Italy, June 1993, Lecture Notes in Computer Science, vol. 684, Springer, Berlin, pp. 106-119.
13. D.J. Lipman, S.F. Altschul, J.D. Kececioglu, A tool for multiple sequence alignment, Proc. Nat. Acad. Sci. U.S.A 86 (1989) 4412-4415.
14. P. Lorimer, Finite projective planes and sharply 2-transitive subsets of finite groups, in: Proc. 2nd Internat. Conf. Theory of Groups, Canberra (1973) 432-436.
15. P. Pevzner, Multiple alignment, communication cost, and graph matching, SIAM J. Appl. Math. 52 (1992) 1763-1779.
16. D. Sankoff, Minimum mutation tree of sequences, SIAM J. Appl. Math. 28 (1975) 35-42.
17. D. Sankoff, Simultaneous solution of the RNA folding, alignment and protosequence problems, SIAM J. Appl. Math. 45 (1985) 810-825.
18. J. Schmidt, A. Siegel, The analysis closed hashing under limited randomness, Proc. 22nd ACM Symp. on Theory of Computing, 1990, pp. 224-234.
19. W.R. Taylor, Hierarchical method to align large numbers of biological sequences. Methods Enzymol. 183 (1990) 456-474.
20. L. Wang, T. Jiang, On the complexity of multiple sequence alignment, J. Comp. Biol. 1 (1994) 337-348.
21. M.S. Waterman, T.F. Smith, W.A. Beyer, Some biological sequence metrics. Adv. in Math. 20 (1976) 367-387.