An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree

Information Processing Letters

Volumn 63, Issue 5, 1997, Pages 263-269

  Wu, B Y ^a   Tang, C Y ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Computational biology; Evolutionary tree

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

EVOLUTIONARY TREE;

ALGORITHMS;

EID: 0031221297     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00109-9     Document Type: Article

References (8)

1. J. Culberson and P. Rudnicki, A fast algorithm for constructing trees from distance matrices, Inform. Process. Lett. 30 (1989) 215-220.
2. W.H.E. Day, Computationally difficult parsimony problems in phylogenetic systematics, J. Theoret. Biology 103 (1983) 429-438.
3. W.H.E. Day, D.S. Johnson and D. Sankoff, The computational complexity of inferring rooted phylogenies by parsimony, Math. Bioscience 81 (1986) 33-42.
4. W.H.E. Day, Computational complexity of inferring phylogenies from dissimilarity matrices, Bull. Math. Biology 49 (4) (1987) 461-467.
5. M. Farach, S. Kannan and T. Warnow, A robust model for finding optimal evolutionary tree, Algorithmica 13 (1995) 155-179.
6. S. Kannan, E. Lawler and T. Warnow, Determining the evolutionary tree, in: Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, 475-484, San Francisco, CA (1990) 475-484.
7. M. Krivanek, The complexity of ultrametric partitions on graph, Inform. Process. Lett. 27 (5) (1988) 265-270.
8. M.S. Waterman, T.F. Smith, M. Singh and W.A. Beyer, Additive evolutionary tree, J. Theor. Biology 64 (1977) 199-213.