Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics
DOI10.1016/J.AMC.2011.04.073zbMATH Open1217.92070OpenAlexW1993184187MaRDI QIDQ555381FDOQ555381
Authors: I-Lin Wang, Hui-E Yang 
Publication date: 22 July 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.04.073
Recommendations
- Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
- Mathematical properties and bounds on haplotyping populations by pure parsimony
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
- Complete Parsimony Haplotype Inference Problem and Algorithms
- Fast perfect phylogeny haplotype inference.
Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Genetics and epigenetics (92D10) Integer programming (90C10) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
- The haplotyping problem: an overview of computational models and solutions
- Efficient Haplotype Inference with Pseudo-boolean Optimization
- Boosting haplotype inference with local search
- A practical algorithm based on particle swarm optimization for haplotype reconstruction
- Particle swarm optimization for SNP haplotype reconstruction problem
Cited In (15)
- Mathematical properties and bounds on haplotyping populations by pure parsimony
- Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
- A class representative model for pure parsimony haplotyping
- A set-covering approach with column generation for parsimony haplotyping
- Boosting haplotype inference with local search
- Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
- The pure parsimony haplotyping problem: overview and computational advances
- Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data
- Research in Computational Molecular Biology
- A fast haplotype inference method for large population genotype data
- A new mathematical modeling for pure parsimony haplotyping problem
- Solving haplotyping inference parsimony problem using a new basic polynomial formulation
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
- Complete Parsimony Haplotype Inference Problem and Algorithms
- Haplotype Inference Constrained by Plausible Haplotype Data
Uses Software
This page was built for publication: Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555381)
