Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics

DOI10.1016/J.AMC.2011.04.073zbMath1217.92070OpenAlexW1993184187MaRDI QIDQ555381

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

zbMATH Keywords

integer programmingbioinformaticshaplotype inferencecompatibility graph

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Uses Software

• MiniSat
• HAPLO
• RPOLY

Cites Work

• Unnamed Item
• Boosting haplotype inference with local search
• A practical algorithm based on particle swarm optimization for haplotype reconstruction
• The haplotyping problem: an overview of computational models and solutions
• Particle swarm optimization for SNP haplotype reconstruction problem
• Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
• Theory and Applications of Satisfiability Testing
• Efficient Haplotype Inference with Pseudo-boolean Optimization

This page was built for publication: Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics