Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites
- 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
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.
KeywordsFixed-parameter algorithm haplotyping pedigree
Unable to display preview. Download preview PDF.