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

  • Duong D. Doan
  • Patricia A. Evans
Conference paper

DOI: 10.1007/978-3-642-13078-6_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6053)
Cite this paper as:
Doan D.D., Evans P.A. (2010) Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites. In: Borodovsky M., Gogarten J.P., Przytycka T.M., Rajasekaran S. (eds) Bioinformatics Research and Applications. ISBRA 2010. Lecture Notes in Computer Science, vol 6053. Springer, Berlin, Heidelberg

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(2k ·n2) exact algorithm, where n is the number of members and k is the number of recombination events.

Keywords

Fixed-parameter algorithm haplotyping pedigree 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Duong D. Doan
    • 1
  • Patricia A. Evans
    • 1
  1. 1.Faculty of Computer ScienceUniversity of New BrunswickFredericton, New BrunswickCanada

Personalised recommendations