Fixed-parameter algorithm for general pedigrees with a single pair of sites

Authors:
Duong D. Doan;Patricia A. Evans
Affiliations:
Faculty of Computer Science, University of New Brunswick, Fredericton, New Brunswick, Canada;Faculty of Computer Science, University of New Brunswick, Fredericton, New Brunswick, Canada
Venue:
ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
Year:
2010

Citing 9
Cited 1

Efficient rule-based haplotyping algorithms for pedigree data

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
HAPLORE: a program for haplotype reconstruction in general pedigrees without recombination

Bioinformatics
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Journal of Computer and System Sciences
Complexity and approximation of the minimum recombinant haplotype configuration problem

Theoretical Computer Science
Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Linear-Time haplotype inference on pedigrees without recombinations

WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Finding odd cycle transversals

Operations Research Letters
Parameterized Complexity

Parameterized Complexity

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

WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics

Quantified Score

Hi-index	0.00

Visualization

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.