Publication Date

3-17-1994

Technical Report Number

TR94-05

Subjects

Mathematics of Computing

Abstract

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.

Share

COinS