Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree

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

Volumn 937, Issue , 1995, Pages 330-339

  Ravi, R ^a   Kececioglu, John D ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF GEORGIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84948977657     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60044-2_52     Document Type: Conference Paper

References (5)

1. T. Jiang, E. L. Lawler, and L. Wang, “Aligning sequences via an evolutionary tree: complexity and approximation,” Proc. 26th A CM Symposium on the Theory of Computing, 760-769 (1994).
2. D. Sankoff, “Minimal mutation trees of sequences,” SIAM J. Appl. Math., 28(1), 35-42, (1975).
3. D. Sankoff, R. Cedergren and G. Laplame, “Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA,” J. Mol. Evol. 7, 133-149, (1976).
4. D. Sankoff and R. Gedergren, “Simultaneous comparisons of three or more sequences related by a tree, in D. Sankoff and J. KruskM (eds.) Time warps, string edits and macromolecules: the theory and practice of sequence comparison, 253-264, Addison Wesley, Reading MA, (1983).
5. M. S. Waterman and M. D. Perlwitz, “Line geometries for sequence comparisons,” Bull. Math. Biol. 46, 567-577, (1984).