论文信息 - Constructing the Maximum Consensus Tree from Rooted Triples

Constructing the Maximum Consensus Tree from Rooted Triples

We investigated the problem of constructing the maximum consensus tree from rooted triples. We showed the NP-hardness of the problem and developed exact and heuristic algorithms. The exact algorithm is based on the dynamic programming strategy and runs in O((m + n2)3n) time and O(2n) space. The heuristic algorithms run in polynomial time and their performances are tested and shown by comparing with the optimal solutions. In the tests, the worst and average relative error ratios are 1.200 and 1.072 respectively. We also implemented the two heuristic algorithms proposed by Gasieniec et al. The experimental result shows that our heuristic algorithm is better than theirs in most of the tests.

Bang Ye Wu | B. Wu

[1] M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] C. L. Liu. Elements of Discrete Mathematics , 1985 .

[4] Andrzej Lingas,et al. On the Complexity of Computing Evolutionary Trees , 1997, COCOON.

[5] Nicholas C. Wormald,et al. Reconstruction of Rooted Trees From Subtrees , 1996, Discret. Appl. Math..

[6] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[7] David R. Karger,et al. Minimum cuts in near-linear time , 1996, STOC '96.

[8] Jesper Jansson,et al. On the Complexity of Inferring Rooted Evolutionary Trees , 2001, Electron. Notes Discret. Math..

[9] Andrzej Lingas,et al. On the Complexity of Constructing Evolutionary Trees , 1999, J. Comb. Optim..

[10] Constructing a Tree from Homeomorphic Subtrees, with , 1999 .

[11] Tandy J. Warnow,et al. Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology , 1996, SODA '96.

[12] Alfred V. Aho,et al. Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions , 1981, SIAM J. Comput..