2005/05/13 by Rudi Cilibrasi, Leo van Iersel, Cilibrasi, Rudi +5
Biochemistry, Genetics and Molecular Biology · #Bioinformatics and Genomic Networks #FOS: Biological sciences #Gene expression and cancer classification #Genetic Associations and Epidemiology #Genomics (q-bio.GN) #q-bio.GN
paper · pdf · doi:10.48550/arxiv.q-bio/0505023
12 pages. Submitted to WABI2005, are awaiting a decision on whether it has been accepted
arxiv created 2005/05/13 · openalex publication_date 2005/05/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we present a collection of results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequenced haplotype data. More specifically, we show that an interesting, restricted case of Minimum Error Correction (MEC) is NP-hard, point out problems in earlier claims about a related problem, and present a polynomial-time algorithm for the ungapped case of Longest Haplotype Reconstruction (LHR). Secondly, we present a polynomial time algorithm for the problem of resolving genotype data using as few haplotypes as possible (the Pure Parsimony Haplotyping Problem, PPH) where each genotype has at most two ambiguous positions, thus solving an open problem posed by Lancia et al in "Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms."