An ILP solution for the gene duplication problem
Author Information
Author(s): Chang Wen-Chieh, Burleigh Gordon J, Fernández-Baca David F, Eulenstein Oliver
Primary Institution: Iowa State University
Hypothesis
Can integer linear programming (ILP) provide an exact solution to the gene duplication problem?
Conclusion
The ILP solution can solve instances of the gene duplication problem with up to 14 taxa and 1,000 genes, providing new insights into plant systematics.
Supporting Evidence
- The ILP formulation can solve the gene duplication problem for data sets with up to 14 taxa.
- The optimal solution places Gnetales sister to the conifers.
- This work provides a large-scale genomic perspective on phylogenetic questions.
- Simulations showed that the ILP solution is faster than heuristic methods for certain data sets.
Takeaway
This study created a new way to solve a tricky problem about how genes duplicate over time, helping scientists understand plant relationships better.
Methodology
The study used integer linear programming to formulate and solve the gene duplication problem exactly.
Potential Biases
The study's conclusions may be influenced by the specific gene trees and taxa selected for analysis.
Limitations
The results may not be definitive due to limited taxon sampling and potential issues with rooting gene trees.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website