Mathematical properties and bounds on haplotyping populations by pure parsimony

DOI10.1016/j.mbs.2011.02.008zbMath1214.92053OpenAlexW2002376718WikidataQ51598764 ScholiaQ51598764MaRDI QIDQ541881

I-Lin Wang, Chia-Yuan Chang

Publication date: 8 June 2011

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mbs.2011.02.008

zbMATH Keywords

integer programmingbioinformaticshaplotype inferencecompatible graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10)

Uses Software

• RPOLY
• MaxCliqueDyn

Cites Work

• Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
• Efficient Haplotype Inference with Pseudo-boolean Optimization
• Unnamed Item

This page was built for publication: Mathematical properties and bounds on haplotyping populations by pure parsimony