An efficient exact algorithm for the minimum ultrametric tree problem

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

Volumn 3341, Issue , 2004, Pages 282-293

  Chen, Hsin Fu ^a   Chang, Maw Shang ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; EVOLUTIONARY ALGORITHMS; FORESTRY;

BRANCH-AND-BOUND ALGORITHMS; CONSTRUCTION PROBLEM; EFFICIENT EXACT ALGORITHMS; EVOLUTIONARY TREE; LOW BOUND; NP-HARD; OPTIMALITY; SUB-PROBLEMS; TREE CONSTRUCTION; ULTRAMETRIC TREES; LOWER BOUNDS;

TREES (MATHEMATICS);

EID: 35048871573     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_26     Document Type: Article

References (11)

1. S.R. Arikati and C.P. Rangan, Linear algorithm for optimal path cover problem on interval graphs, Inform. Process. Lett. 35 (1990) 149-153.
2. Charles H. Bennett and Ming Li and Bin Ma: Chain letters and evolutionary histories. Scientific American (2003) 76-81
3. James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan: Making data structures persistent. Journal of Computer and System Sciences 38 (1989) 86-124
4. Martin Farach, Sampath Kannan, and Tandy Warnow: A robust model for finding optimal evolutionary trees. Algorithmica 13 (1995) 155-179
5. M. D. Hendy and David Penny: Branch and bound algorithms to determine minimal evolutionary trees. Mathematical Biosciences 59 (1982) 277-290
6. Chia-Mao Huang and Chang-Biau Yang: Approximation algorithms for constructing evolutionary trees. In: Proceedings of 2001 National Computer Symposium, Taipei, Taiwan (2001) A099-A109
7. C. D. Michener and R. R. Sokal: A quantitative approach to a problem in classification. Evolution 11 (1957) 130-162
8. D. Penny and M. D. Hendy and M. A. Steel: Progress with methods for constructing evolutionary trees. Trends in Ecology and Evolution 7 (1992) 73-79
9. João Setubal and João Meidanis: Introduction to computational molecular biology. PWS Publishing Company (1997)
10. N. Saitou and M. Nei:, The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4 (1987) 406-425
11. Bang Ye Wu, Kun-Mao Chao, and Chuan Yi Tang: Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices. Journal of Combinatorial Optimization 3 (1999) 199-211