Constructing evolutionary trees from rooted triples

Journal of Information Science and Engineering

Volumn 20, Issue 1, 2004, Pages 181-190

  Wu, Bang Ye ^a  

^a SHU TE UNIVERSITY   (Taiwan)

Author keywords

Computational biology; Consensus tree; Evolutionary tree; Heuristic algorithm; NP hard

Indexed keywords

BIOLOGY; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; TREES (MATHEMATICS);

COMPUTATIONAL BIOLOGY; CONSENSUS TREE; EVOLUTIONARY TREES; HEURISTIC ALGORITHM;

INFORMATION SCIENCE;

EID: 0842312248     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. A. V. Aho, Y. Sagiv, T. G. Szymanski, and J. D. Ullman, "Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions," SIAM Journal on Computing, Vol. 10, 1981, pp. 405-421.
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.
3. L. Gasieniec, J. Jansson, A. Lingas, and A. Ostlin, "On the complexity of computing evolutionary trees," in Proceedings of the 3rd Annual International Computing and Combinatorics Conference (COCOON '97), 1997, pp. 134-145.
4. J. Jansson, "On the complexity of inferring rooted evolutionary trees," in the Proceedings of the Brazilian Symposium on Graph, Algorithms, and Combinatorics, Vol. 7, 2001, pp. 121-125.
5. R. M. Karp, "Reducibility among combinatorial problems," in R. E. Miller and J. W. Thatcher (eds.) Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
6. M. P. Ng and N. C. Wormald, "Reconstruction of rooted trees from subtrees," Discrete Applied Mathematics, Vol. 69, 1996, pp. 19-31.
7. M. Steel, "The complexity of reconstructing trees from qualitative characters and subtrees," Journal of Classification, Vol. 9, 1992, pp. 91-116.
8. B. Y. Wu, "Constructing the maximum consensus tree from rooted triples," to appear in Journal of Combinatorial Optimization.