An ILP solution for the gene duplication problem
<p>Abstract</p> <p>Background</p> <p>The gene duplication (GD) problem seeks a species tree that implies the fewest gene duplication events across a given collection of gene trees. Solving this problem makes it possible to use large gene families with complex histories...
Main Authors: | Fernández-Baca David F, Burleigh Gordon J, Chang Wen-Chieh, Eulenstein Oliver |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2011-02-01
|
Series: | BMC Bioinformatics |
Similar Items
-
Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence
by: Chaudhary Ruchi, et al.
Published: (2012-06-01) -
Maximum likelihood models and algorithms for gene tree evolution with duplications and losses
by: Burleigh Gordon J, et al.
Published: (2011-02-01) -
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
by: Burleigh J Gordon, et al.
Published: (2010-01-01) -
Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem
by: Górecki Pawel, et al.
Published: (2012-06-01) -
Improved Heuristics for Minimum-Flip Supertree Construction
by: J.Gordon Burleigh, et al.
Published: (2006-01-01)