Paper Info
Title
An ILP solution for the gene duplication problem.
Abstract
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 of duplication and loss to infer phylogenetic trees. However, the GD problem is NP-hard, and therefore, most analyses use heuristics that lack any performance guarantee.We describe the first integer linear programming (ILP) formulation to solve instances of the gene duplication problem exactly. With simulations, we demonstrate that the ILP solution can solve problem instances with up to 14 taxa. Furthermore, we apply the new ILP solution to solve the gene duplication problem for the seed plant phylogeny using a 12-taxon, 6,084-gene data set. The unique, optimal solution, which places Gnetales sister to the conifers, represents a new, large-scale genomic perspective on one of the most puzzling questions in plant systematics.Although the GD problem is NP-hard, our novel ILP solution for it can solve instances with data sets consisting of as many as 14 taxa and 1,000 genes in a few hours. These are the largest instances that have been solved to optimally to date. Thus, this work can provide large-scale genomic perspectives on phylogenetic questions that previously could only be addressed by heuristic estimates.
Year
DOI
Venue
2011
10.1186/1471-2105-12-S1-S14
BMC Bioinformatics
Keywords
Field
DocType
genomics,gene duplication,microarrays,phylogenetic tree,computer simulation,bioinformatics,phylogeny,gene family,algorithms
Phylogenetic tree,Gene,Biology,Genomics,Heuristics,Integer programming,Bioinformatics,Genetics,Phylogenetics,Gene duplication,Gene family
Journal
Volume
Issue
ISSN
12 Suppl 1
Suppl 1
1471-2105
Citations 
PageRank 
References 
19
0.68
16
Authors
4
Name
Order
Citations
PageRank
Wen-Chieh Chang11197.15
J. Gordon Burleigh222114.24
David F Fernández-Baca3190.68
Oliver Eulenstein450552.71