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

DOI10.1137/080680990zbMath1177.05113OpenAlexW2035389590MaRDI QIDQ3654374

Mee Yee Chan, Wun-Tat Chan, Stanley P. Y. Fung, Ming-Yang Kao, Francis Y. L. Chin

Publication date: 6 January 2010

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10722/60605

zbMATH Keywords

pedigreerecombinationcomputational biologyhaplotype inference

Mathematics Subject Classification ID

Problems related to evolution (92D15) Number-theoretic algorithms; complexity (11Y16) Graph algorithms (graph-theoretic aspects) (05C85) General topics in the theory of algorithms (68W01)

Related Items (4)

An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants ⋮ Solving haplotype inference problem with non-genotyped founders via integer linear programming ⋮ 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

This page was built for publication: Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops