A large version of the small parsimony problem

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

Volumn 2812, Issue , 2003, Pages 417-432

  Fredslund, Jakob ^a   Hein, Jotun ^b   Scharling, Tejs ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

AFFINE FUNCTION; EVOLUTIONARY TREE; GAP PENALTIES; INTERNAL NODES; MULTIPLE ALIGNMENT; RUNNING TIME;

ALIGNMENT;

EID: 21144438164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39763-2_30     Document Type: Article

References (13)

1. W. M. Fitch Towards defining the course of evolution minimum change for a specific tree topology. Systematic Zoology 20.406-416, 1971.
2. D. Sankoff Matching sequences under deletion/insertion constraints. Proc. Natl. Acad. Sci. USA 69.4-6, 1972.
3. J. A. Hartigan Minimum mutation fits to a given tree. Biometrics 20.53-65, 1973.
4. P. Sellers An algorithm for the distance between two finite sequences. J. Comb. Theory 16.253-258, 1974.
5. D. Sankoff Minimal mutation trees of sequences. SIAM J. appl. Math 78.35-42, 1975.
6. M. S. Waterman, T. F. Smith, and W. A. Beyer Some biological sequence metrics. Advances in Mathematics 20.367-387, 1976.
7. O. Gotoh An improved algorithm for matching biological sequences. J. Mol. Biol. 162.705-708, 1981.
8. M. L. Fredman Algorithms for computing evolutionary similarity measures with length independent gap penalties. Bull. Math. Biol. 46.4.545-563, 1984.
9. J. J. Hein A method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given. Mol.Biol.Evol. 6.6.649-668, 1989.
10. L. Wang, T. Jiang, and E. L. Lawler Approximation Algorithms for Tree Alignment with a Given Phylogeny. Algorithmica 16:302-315, 1996.
11. L. Wang and D. Gusfield Improved Approximation Algorithms for Tree Alignment. CPM 1996 220-233.
12. J. Stoye Multiple sequence alignment with the divide-and-conquer method. Gene 211 (2), GC45-GC56, 1998.
13. E. Althaus, A. Caprara, H.-P. Lenhof, and K.Reinert Multiple sequence alignment with arbitrary gap costs Computing an optimal solution using polyhedral combinatorics. ECCB 2002 4-16.