Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard

Tatsuie Tsukiji, Zhi-Zhong Chen. Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. In Kyung-Yong Chwa, J. Ian Munro, editors, Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings. Volume 3106 of Lecture Notes in Computer Science, pages 450-461, Springer, 2004. [doi]

Abstract

Abstract is missing.