Linear-Time Algorithms for the Multiple Gene Duplication Problems

Authors:
Cheng-Wei Luo;Ming-Chiang Chen;Yi-Ching Chen;Roger W. L. Yang;Hsiao-Fei Liu;Kun-Mao Chao
Affiliations:
National Taiwan University, Taipei;National Taiwan University, Taipei;National Taiwan University, Taipei;National Taiwan University, Taipei;National Taiwan University, Taipei;National Taiwan University, Taipei
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2011

Citing 7
Cited 1

From Gene Trees to Species Trees

SIAM Journal on Computing
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
The multiple gene duplication problem revisited

Bioinformatics
An Ω(n^2/ log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Heuristics for the gene-duplication problem: a Θ(n) speed-up for the local search

RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
The gene-duplication problem: near-linear time algorithms for NNI based local searches

ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
Locating multiple gene duplications through reconciled trees

RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology

From Gene Trees to Species Trees II: Species Tree Inference by Minimizing Deep Coalescence Events

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fundamental problem arising in the evolutionary molecular biology is to discover the locations of gene duplications and multiple gene duplication episodes based on the phylogenetic information. The solutions to the MULTIPLE GENE DUPLICATION problems can provide useful clues to place the gene duplication events onto the locations of a species tree and to expose the multiple gene duplication episodes. In this paper, we study two variations of the MULTIPLE GENE DUPLICATION problems: the EPISODE-CLUSTERING (EC) problem and the MINIMUM EPISODES (ME) problem. For the EC problem, we improve the results of Burleigh et al. with an optimal linear-time algorithm. For the ME problem, on the basis of the algorithm presented by Bansal and Eulenstein, we propose an optimal linear-time algorithm.