Algorithms and Computation

DOI10.1007/11602613zbMath1173.92312OpenAlexW2304246803MaRDI QIDQ5897870

Tao Jiang, Jing Xiao, Xi Chen, Lan Liu

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

zbMATH Keywords

pedigreecomplexityapproximationSNPchildrenhaplotypingbounded numberL-reductionmatesnegative resultpositive resultrecombinant

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10)

Related Items (1)

An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants

This page was built for publication: Algorithms and Computation