Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms

@article{Lancia2004HaplotypingPB,
  title={Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms},
  author={G. Lancia and M. C. Pinotti and R. Rizzi},
  journal={INFORMS J. Comput.},
  year={2004},
  volume={16},
  pages={348-359}
}
In this paper we address the pure parsimony haplotyping problem: Find a minimum number of haplotypes that explains a given set of genotypes. We prove that the problem is APX-hard and present a 2k- 1-approximation algorithm for the case in which each genotype has at most k ambiguous positions. We further give a new integer-programming formulation that has (for the first time) a polynomial number variables and constraints. Finally, we give approximation algorithms, not based on linear programming… Expand
Solving haplotyping inference parsimony problem using a new basic polynomial formulation
TLDR
A new polynomial model for the haplotyping inference by parsimony problem characterized by the original use of a maximum formulation jointly with a good heuristic solution is presented. Expand
Extended Islands of Tractability for Parsimony Haplotyping
TLDR
It is shown that the problem becomes polynomial-time solvable if the given set of genotypes is complete, i.e., contains all possible genotypes that can be explained by the set of haplotypes. Expand
Islands of Tractability for Parsimony Haplotyping
TLDR
It is proved that the parsimony approach to haplotype inference, which calls for finding a set of haplotypes of minimum cardinality that explains an input set of genotypes, is APX-hard even in very restricted cases. Expand
Islands of tractability for parsimony haplotyping
We study the parsimony approach to haplotype inference, which calls for finding a set ofhaplotypes of minimum cardinality that explains an input set of genotypes. We prove that the problem isExpand
On the Complexity of Several Haplotyping Problems
TLDR
It is shown that an interesting, restricted case of Minimum Error Correction (MEC) is NP-hard, earlier claims about a related problem are questioned, and a polynomial-time algorithm is presented for the ungapped case of Longest Haplotype Reconstruction (LHR). Expand
Pure Parsimony Xor Haplotyping
TLDR
This paper proposes a formulation based on a well-known model used in haplotype inference: pure parsimony, and shows that the problem has a polynomial time k-approximation, where k is the maximum number of xor-genotypes containing a given single nucleotide polymorphisms (SNP). Expand
Pure Parsimony Xor Haplotyping
TLDR
This paper proposes a formulation based on a well known model used in haplotype inference: pure parsimony and produces an experimental analysis showing that it scales to real-world instances taken from the HapMap project. Expand
Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuristics
TLDR
Two new heuristic HIPP algorithms are proposed, MGP and GHI, which exploits the compatible relations among genotypes to solve a reduced integer linear programming problem so that a solution of good quality can be obtained very quickly. Expand
A Set-Covering Approach with Column Generation for Parsimony Haplotyping
TLDR
This work introduces an exact algorithm, based on integer linear programming (ILP), for the parsimony haplotyping problem (PHP), based on a set-covering formulation of the problem, solved by branch and bound with both column and row generation. Expand
Parsimony haplotyping in polynomial time
Parsimony haplotyping is the problem of finding a set of haplotypes of minimum cardinality that explains a given set of genotypes, where the genotype is the combination of two haplotypes. ThisExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 28 REFERENCES
Haplotype Inference by Pure Parsimony
TLDR
The results are that the Pure Parsimony problem can be solved efficiently in practice for a wide range of problem instances of current interest in biology. Expand
A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations
The next phase of human genomics will involve largescale screens of populations for signi cant DNA polymorphisms, notably single nucleotide polymorphisms (SNP's). Dense human SNP maps are currentlyExpand
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem
TLDR
The first practical algorithms for the Haplotyping Problem are given, which do not require the fragments to not include each other, and are polynomial for each constant k bounding the total number of holes in the data. Expand
Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms
TLDR
The problem is NP-hard and, in fact, Max-SNP complete; it is shown that the reduction creates problem instances conforming to a severe restriction believed to hold in real data; and an approach based on that operation and (integer) linear programming works quickly and correctly on simulated data. Expand
Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem
TLDR
Algorithmic considerations in a new approach for haplotype determination: inferring haplotypes from localised polymorphism data gathered from short genome 'fragments' are presented. Expand
Haplotyping as Perfect Phylogeny: A Direct Approach
TLDR
The algorithmic implications of the no-recombination in long blocks observation is explored, for the problem of inferring haplotypes in populations, and a simple, easy-to-program, O(nm(2))-time algorithm is established that determines whether there is a PPH solution for input genotypes and produces a linear-space data structure to represent all of the solutions. Expand
Optimization, Approximation, and Complexity Classes
TLDR
It follows that such a complete problem has a polynomial-time approximation scheme iff the whole class does, and that a number of common optimization problems are complete for MAX SNP under a kind of careful transformation that preserves approximability. Expand
SNPs Problems, Complexity, and Algorithms
TLDR
It is shown that the general SNPs Haplotyping Problem is NP-hard for mate-pairs assembly data, and polynomial time algorithms for fragment assembly data are designed, and the Minimum SNPs Removal problem amounts to finding the largest independent set in a weakly triangulated graph. Expand
Haplotype Reconstruction from SNP Alignment
TLDR
This paper considers the case of a pair of homologous human chromosomes, one from the mother and the other from the father, and describes a method for statistical reconstruction of haplotypes from a set of aligned SNP fragments. Expand
Inference of haplotypes from PCR-amplified samples of diploid populations.
  • A. Clark
  • Biology, Medicine
  • Molecular biology and evolution
  • 1990
TLDR
Details of the algorithm for extracting allelic sequences from population samples, along with some population-genetic considerations that influence the likelihood for success of the method, are presented here. Expand
...
1
2
3
...