The multiple gene duplication problem revisited

被引：29

作者：

Bansal, Mukul S. ^{[1
]}

Eulenstein, Oliver ^{[1
]}

机构：

[1] Iowa State Univ, Dept Comp Sci, Ames, IA 50011 USA

来源：

BIOINFORMATICS | 2008年 / 24卷 / 13期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1093/bioinformatics/btn150

中图分类号：

Q5 [生物化学];

学科分类号：

071010 ; 081704 ;

摘要：

Motivation: Deciphering the location of gene duplications and multiple gene duplication episodes on the Tree of Life is fundamental to understanding the way gene families and genomes evolve. The multiple gene duplication problem provides a framework for placing gene duplication events onto nodes of a given species tree, and detecting episodes of multiple gene duplication. One version of the multiple gene duplication problem was defined by Guigo et al. in 1996. Several heuristic solutions have since been proposed for this problem, but no exact algorithms were known. Results: In this article we solve this longstanding open problem by providing the first exact and efficient solution. We also demonstrate the improvement offered by our algorithm over the best heuristic approaches, by applying it to several simulated as well as empirical datasets.

引用

页码：I132 / I138

页数：7

共 34 条

[1]

Arvestad L., 2004, P 8 ANN INT C RESAER, P326, DOI DOI 10.1145/974614.974657

[2]

ARVESTAD L, 2003, P 11 INT C INT SYST, P7

[3] A recent polyploidy superimposed on older large-scale duplications in the Arabidopsis genome [J].