loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Linear-Time Algorithms for the Multiple Gene Duplication Problems
PrePrint
ISSN: 1545-5963
ASCII Text
x 
 
Cheng-Wei Luo, Ming-Chiang Chen, Yi-Ching Chen, Roger W.L. Yang, Hsiao-Fei Liu, Kun-Mao Chao, "Linear-Time Algorithms for the Multiple Gene Duplication Problems," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 99, no. 1, pp. , , 5555.
 
 
BibTex
x
 
@article{ 10.1109/TCBB.2009.52,
author = {Cheng-Wei Luo and Ming-Chiang Chen and Yi-Ching Chen and Roger W.L. Yang and Hsiao-Fei Liu and Kun-Mao Chao},
title = {Linear-Time Algorithms for the Multiple Gene Duplication Problems},
journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics},
volume = {99},
number = {1},
issn = {1545-5963},
year = {5555},
doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2009.52},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE/ACM Transactions on Computational Biology and Bioinformatics
TI - Linear-Time Algorithms for the Multiple Gene Duplication Problems
IS - 1
SN - 1545-5963
SP
EP
EPD -
A1 - Cheng-Wei Luo,
A1 - Ming-Chiang Chen,
A1 - Yi-Ching Chen,
A1 - Roger W.L. Yang,
A1 - Hsiao-Fei Liu,
A1 - Kun-Mao Chao,
PY - 5555
KW - Computations on discrete structures
KW - Trees
KW - Computational phylogenetics
KW - Gene duplication
VL - 99
JA - IEEE/ACM Transactions on Computational Biology and Bioinformatics
ER -
 
Cheng-Wei Luo, National Taiwan University, Taipei
Ming-Chiang Chen, National Taiwan University, Taipei
Yi-Ching Chen, National Taiwan University, Taipei
Roger W.L. Yang, National Taiwan University, Taipei
Hsiao-Fei Liu, National Taiwan University, Taipei
Kun-Mao Chao, National Taiwan University, Taipei
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.
Index Terms:
Computations on discrete structures, Trees, Computational phylogenetics, Gene duplication
Citation:
Cheng-Wei Luo, Ming-Chiang Chen, Yi-Ching Chen, Roger W.L. Yang, Hsiao-Fei Liu, Kun-Mao Chao, "Linear-Time Algorithms for the Multiple Gene Duplication Problems," IEEE/ACM Transactions on Computational Biology and Bioinformatics, 15 May. 2009. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TCBB.2009.52>
Usage of this product signifies your acceptance of the Terms of Use.