Constructing the maximum consensus tree from rooted triples

Journal of Combinatorial Optimization

Volumn 8, Issue 1, 2004, Pages 29-39

  Wu, Bang Ye ^a  

^a SHU TE UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Computational biology; Dynamic programming; Evolutionary trees; NP hardness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; ERROR ANALYSIS; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING; TIME AND MOTION STUDY; TREES (MATHEMATICS);

COMPUTATIONAL BIOLOGY; EVOLUTIONARY TREES; HEURISTICALGORITHMS; NP-HARDNESS;

MATHEMATICAL PROGRAMMING;

EID: 3543083964     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOCO.0000021936.04215.68     Document Type: Article

References (11)

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, no. 3, pp. 405-421, 1981.
2. L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton University Press: Princeton, New Jersey, 1962.
3. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company: San Fransisco, 1979.
4. L. Gasieniec, J. Jansson, A. Lingas, and A. Östlin, "On the complexity of constructing evolutionary trees," Journal of Combinatorial Optimization, vol. 3, pp. 183-197, 1999.
5. M.R. Henzinger, V. King, and T. Warnow, "Constructing a tree from homeomorphic subtrees, with applications to computational biology," in Proc. of the 7th ACM-SIAM SODA, 1996, pp. 333-340.
6. J. Jansson, "On the complexity of inferring rooted evolutionary trees," in Proceedings of the Brazilian Symposium on Graph, Algorithms, and Combinatorics (GRACO01), Fortaleza, Electronic Notes in Discrete Mathematics, vol. 7, Elsevier, 2001, pp. 121-125.
7. D.R. Karger, "Minimum cuts in near-linear time," in Proc. of the 28th ACM STOC, 1996, pp. 56-63.
8. R.M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (Eds.), Plenum Press: New York, 1972, pp. 85-103.
9. C.L. Liu, Elements of Discrete Mathematics, 2nd edn. McGraw-Hill: New York, 1998.
10. M.P. Ng and N.C. Wormald, "Reconstruction of rooted trees from subtrees," Discrete Applied Mathematics, vol. 69, pp. 19-31, 1996.
11. M. Steel, "The complexity of reconstructing trees from qualitative characters and subtrees," Journal of Classification, vol. 9, pp. 91-116, 1992.