Fixed-parameter algorithm for haplotype inferences on general pedigrees with small number of sites

Abstract

The problem of computing the minimum number of recombination events for general pedigrees with a small number of sites is investigated. We show that this NP-hard problem can be parametrically reduced to the Bipartization by Edge Removal problem with additional parity constraints. The problem can be solved by an O(2k2m2 n2m3) exact algorithm, where n is the number of members, m is the number of sites, and k is the number of recombination events. © 2010 Springer-Verlag.