A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States Is Fixed (1994) [41 citations — 1 self]
by
Richa Agarwala
,
David Fernández-Baca
,
David
,
Fern Andez-baca
SIAM Journal on Computing
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Agarwala94apolynomial-time,
author = {Richa Agarwala and David Fernández-Baca and David and Fern Andez-baca},
title = {A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States Is Fixed},
journal = {SIAM Journal on Computing},
year = {1994},
volume = {23},
pages = {1216--1224}
}
author = {Richa Agarwala and David Fernández-Baca and David and Fern Andez-baca},
title = {A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States Is Fixed},
journal = {SIAM Journal on Computing},
year = {1994},
volume = {23},
pages = {1216--1224}
}
Years of Citing Articles
Bookmarks
OpenURL
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.
