论文信息 - On the Complexity of Inferring Rooted Evolutionary Trees - 字舞流文

On the Complexity of Inferring Rooted Evolutionary Trees

We prove that the maximum inferred local consensus tree problem is NP-complete, thus resolving an open question from. (form?)

Jesper Jansson | J. Jansson

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

[2] Michael S. Waterman,et al. Introduction to computational biology , 1995 .

[3] Tao Jiang,et al. Orchestrating quartets: approximation and data correction , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[4] João Meidanis,et al. Introduction to computational molecular biology , 1997 .

[5] Sampath Kannan,et al. Computing the local consensus of trees , 1995, SODA '95.

[6] 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..

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

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

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