Chapter

Bioinformatics Research and Applications

Volume 6053 of the series Lecture Notes in Computer Science pp 29-37

Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites

  • Duong D. DoanAffiliated withFaculty of Computer Science, University of New Brunswick
  • , Patricia A. EvansAffiliated withFaculty of Computer Science, University of New Brunswick

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The problem of computing the minimum number of recombination events for general pedigrees with two sites for all members is investigated. We show that this NP-hard problem can be parametrically reduced to the Bipartization by Edge Removal problem and therefore can be solved by an O(2 k ·n 2) exact algorithm, where n is the number of members and k is the number of recombination events.

Keywords

Fixed-parameter algorithm haplotyping pedigree