A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops
From MaRDI portal
Publication:965820
DOI10.1007/s10878-008-9180-yzbMath1186.92033MaRDI QIDQ965820
Publication date: 26 April 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9180-y
general solution; system of linear equations; linear-time algorithm; haplotype inference; mating loop; pedigree analysis; tree-pedigree
92D15: Problems related to evolution
65F99: Numerical linear algebra
92-04: Software, source code, etc. for problems pertaining to biology
92C42: Systems biology, networks
Related Items
Solving haplotype inference problem with non-genotyped founders via integer linear programming, Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders
Cites Work