Agarwala, Richa and Fernandez-Baca, David (1994) A Faster Algorithm for the Perfect Phylogeny Problem when the Number of Characters is Fixed. Technical Report TR94-05, Department of Computer Science, Iowa State University.
A Faster Algorithm for the Perfect Phylogeny Problem
when the Number of Characters is Fixed
Richa Agarwala and David Fernandez-Baca
We present an algorithm for determining whether a set of species, described by
the characters they exhibit, has a perfect phylogeny, assuming the maximum
number of characters is fixed. This algorithm is simpler and faster than the
known algorithms when the number of characters is at least 4.
Contact site administrator at: email@example.com