On the complexity of inferring rooted evolutionary trees

Electronic Notes in Discrete Mathematics

Volumn 7, Issue , 2001, Pages 50-53

  Jansson, Jesper ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34247107276     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/s1571-0653(04)00222-7     Document Type: Article

References (10)

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, 1981, pp. 405-421.
2. M. Garey and D. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
3. L. Gasieniec, J. Jansson, A. Lingas, and A. Ostlin. On the Complexity of Constructing Evolutionary Trees. Journal of Combinatorial Optimization, Vol. 3, No. 2/3, 1999, pp. 183-197.
4. M.R. Henzinger, V. King, and T. Warnow. Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. Algorithmica, Vol. 24, No. 1, 1999, pp. 1-13.
5. T. Jiang, P. Kearney, and M. Li. Orchestrating Quartets: Approximation and Data Correction. Proceedings of FOCS'98, 1998, pp. 416-425.
6. S. Kannan, T. Warnow, and S. Yooseph. Computing the Local Consensus of Trees. SIAM Journal on Computing, Vol. 27, No. 6, 1998, pp. 1695-1724.
7. W.-H. Li. Molecular Evolution. Sinauer Associates, Inc., Sunderland, 1997.
8. J.C. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS Publishing Company, Boston, 1997.
9. M. Steel. The Complexity of Reconstructing Trees from Qualitative Characters and Subtrees. Journal of Classification, Vol. 9, No. 1, 1992, pp. 91-116.
10. M. Waterman. Introduction to Computational Biology. Chapman & Hall, Cambridge, 1995.