Article
Toward an algebraic understanding of haplotype inference by pure parsimony.
Computational systems bioinformatics. Computational Systems Bioinformatics Conference - 1 Jan 2006
Brown Daniel G, Harrower Ian M
Abstract excerpt
Haplotype inference by pure parsimony (HIPP) is known to be NP-Hard. Despite this, many algorithms successfully solve HIPP instances on simulated and real data. In this paper, we explore the connection between algebraic rank and the HIPP problem, to help identify easy and hard instances of the problem. The rank of the input matrix is known to be a lower bound on the size an optimal HIPP solution. We show that...
Read the complete abstract on PubMedTopics
Share this publication in a Topic to start or enrich a Post.