Computing phylogenetic roots with bounded degrees and errors is NP-complete

Tatsuie Tsukiji, Zhi-Zhong Chen. Computing phylogenetic roots with bounded degrees and errors is NP-complete. Theoretical Computer Science, 363(1):43-59, 2006. [doi]

Abstract

Abstract is missing.