A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops

DOI10.1007/S10878-008-9180-YzbMath1186.92033OpenAlexW2027596093MaRDI QIDQ965820

Lan Liu, Tao Jiang

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

zbMATH Keywords

general solutionsystem of linear equationslinear-time algorithmhaplotype inferencemating looppedigree analysistree-pedigree

Mathematics Subject Classification ID

Problems related to evolution (92D15) Numerical linear algebra (65F99) Software, source code, etc. for problems pertaining to biology (92-04) Systems biology, networks (92C42)

Related Items (2)

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

• Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops
• Unnamed Item

This page was built for publication: A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops