Computing phylogenetic roots with bounded degrees and errors is hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3106, Issue , 2004, Pages 450-461

  Tsukiji, Tatsuie ^a   Chen, Zhi Zhong ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGY; TREES (MATHEMATICS);

BOUNDED DEGREE; GRAPH G; INTERNAL NODES; MAXIMUM DEGREE; NP-HARD; ROOT PROBLEMS; TECHNICAL CONTRIBUTION;

GRAPH THEORY;

EID: 35048825857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_48     Document Type: Article

References (7)

1. N. BANSAL, A. BLUM, AND S. CHAWLA, Correlation Clustering, in Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), pages 238-250, 2002.
2. Z.-Z. CHEN, T. JIANG, AND G.-H. LIN, Computing phylogenetic roots with bounded degrees and errors, SIAM Journal on Computing, 32(4):864-879, 2003. A preliminary version appeared in Proceedings of WADS2001.
3. M. R. GAREY, D. S. JOHNSON AND R. E. TARJAN, The Planar Hamiltonian Circuit Problem is NP-Complete, SIAM Journal on Computing, 5(4):704-714, 1976.
4. P. E. KEARNEY AND D. G. CORNEIL, Tree powers, Journal of Algorithms, 29:111-131, 1998.
5. G.-H. LIN, P. E. KEARNEY, AND T. JIANG, Phylogenetic k-root and Steiner k-root, in The 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000), volume 1969 of Lecture Notes in Computer Science, pages 539-551, Springer, 2000.
6. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, 1994.
7. D. L. SWOFFORD, G. J. OLSEN, P. J. WADDELL, AND D. M. HILLIS, Phylogenetic inference, In D. M. Hillis, C. Moritz, and B. K. Mable, editors, Molecular Systematics (2nd Edition), pages 407-514, Sinauer Associates, Sunderland, Massachusetts, 1996.