Solving haplotype inference problem with non-genotyped founders via integer linear programming
From MaRDI portal
Publication:434198
DOI10.1007/s10878-010-9340-8zbMath1245.90064OpenAlexW2041819532MaRDI QIDQ434198
Publication date: 10 July 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9340-8
Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05)
Cites Work
- Unnamed Item
- A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops
- Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders
- Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops
This page was built for publication: Solving haplotype inference problem with non-genotyped founders via integer linear programming