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

DOI10.1007/s00453-011-9494-5zbMath1235.92038OpenAlexW2142215982MaRDI QIDQ2428680

Jing Xiao, Tiancheng Lou, Tao Jiang

Publication date: 26 April 2012

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9494-5

zbMATH Keywords

computational biologycombinatorial algorithmprobabilistic model

Mathematics Subject Classification ID

Problems related to evolution (92D15) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08) Software, source code, etc. for problems pertaining to biology (92-04)

Related Items (1)

Tree-k-RHC

Uses Software

• Allegro

Cites Work

• Unnamed Item
• Unnamed Item
• A Markov chain Monte Carlo strategy for sampling from the joint posterior distribution of pedigrees and population parameters under a Fisher-Wright model with partial selfing
• Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops
• Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations
• Computational Science – ICCS 2005
• Algorithms and Computation

This page was built for publication: An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants