| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1708832 | Applied Mathematics Letters | 2012 | 4 Pages |
Abstract
We give a characterization of the minimal obstruction sets for the existence of a perfect phylogeny for a set of three-state characters that can be inferred by testing each pair of characters. This leads to a O(m2n+p)O(m2n+p) time algorithm for outputting all pp minimal obstruction sets for a set of mm three-state characters over a set of nn taxa.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Brad Shutters, David Fernández-Baca,