Locating multiple gene duplications through reconciled trees

Authors:
J. Gordon Burleigh;Mukul S. Bansal;Andre Wehe;Oliver Eulenstein
Affiliations:
National Evolutionary Synthesis Center, Durham, NC;Department of Computer Science, Iowa State University, Ames, IA;Department of Computer Science, Iowa State University, Ames, IA;Department of Computer Science, Iowa State University, Ames, IA
Venue:
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Year:
2008

Citing 5
Cited 2

Intersection graphs of paths in a tree

Journal of Combinatorial Theory Series B
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
A comparative phylogenetic approach for dating whole genome duplication events

Bioinformatics

Beyond evolutionary trees

Natural Computing: an international journal
Linear-Time Algorithms for the Multiple Gene Duplication Problems

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the first exact and efficient algorithm for Guigó et al.'s problem that given a collection of rooted, binary gene trees and a rooted, binary species tree, determines a minimum number of locations for gene duplication events from the gene trees on the species tree. We examined the performance of our algorithm using a set of 85 genes trees that contain genes from a total of 136 plant taxa. There was evidence of large-scale gene duplication events in Populus, Gossypium, Poaceae, Asteraceae, Brassicaceae, Solanaceae, Fabaceae, and near the root of the eudicot clade. However, error in gene trees can produce erroneous evidence of large-scale duplication events, especially near the root of the species tree. Our algorithm can provide hypotheses for precise locations of large-scale gene duplication events with data from relatively few gene trees and can complement other genomic approaches to provide a more comprehensive view of ancient large-scale gene duplication events.