Abstract
We consider the following problem: Given n genotypes, does there exist a set H of haplotypes such that each genotype is generated by a pair from this set, and this det can be derived on a perfect phylogeny. Recently, Gusfield, 2002, presented a polynomial time algorithm to solve this problem that uses established results from matroid and graph theory. In this work, we present an O(nm2) algorithm for this problem using elementary techniques. We also describe a linear space representation for representing all possible solutions, and provide a formula for counting the number of possible solutions.
Cite
CITATION STYLE
Bafna, V., Gusfield, D., Lancia, G., & Yooseph, S. (2004). Haplotyping as perfect phylogeny. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2983, p. 131). Springer Verlag. https://doi.org/10.1007/978-3-540-24719-7_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
