Article
Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice.
IEEE/ACM transactions on computational biology and bioinformatics - 1 Jan 2000
Sridhar Srinath, Dhamdhere Kedar, Blelloch Guy, Halperin Eran, Ravi R, Schwartz Russell
Abstract excerpt
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character states (referred to as BNPP). A perfect phylogeny assumes that every character mutates at most once in the evolutionary tree, yielding an algorithm for binary character states that is computationally efficient but not robust to imperfections in real data. A near-perfect phylogeny relaxes the perfect phylogeny...
Read the complete abstract on PubMedTopics
Share this publication in a Topic to start or enrich a Post.