Article
Constructing near-perfect phylogenies with multiple homoplasy events.
Bioinformatics (Oxford, England) - 15 Jul 2006
Satya Ravi Vijaya, Mukherjee Amar, Alexe Gabriela, Parida Laxmi, Bhanot Gyan
Abstract excerpt
MOTIVATION: We explore the problem of constructing near-perfect phylogenies on bi-allelic haplotypes, where the deviation from perfect phylogeny is entirely due to homoplasy events. We present polynomial-time algorithms for restricted versions of the problem. We show that these algorithms can be extended to genotype data, in which case the problem is called the near-perfect phylogeny haplotyping (NPPH) problem....
Read the complete abstract on PubMedTopics
Share this publication in a Topic to start or enrich a Post.