Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
Download PDF

Abstract

We present a polynomial-time algorithm for determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the maximum number of possible states for a character is fixed. This solves a longstanding open problem. Our result should be contrasted with the proof by Steel and Bodlaender, Fellows, and Warnow that the perfect phylogeny problem is NP-complete in general.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!

Related Articles