.png){kind=icon}
Return
Linear-Time Algorithms for the Multiple Gene Duplication Problems
.png){kind=icon}
OA
AI
DOI：10.1109/TCBB.2009.52.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Computational phylogenetics
gene duplication
computations on discrete structures
linear-time algorithm
Journal
I
IF:
3.4
Papers:
3.3K
Citations:
6.4K
Organization
Cited Papers
No Morphometric Distinction between the Host Constrictotermes cyphergaster (Silvestri) (Isoptera: Termitidae, Nasutitermitinae) and its Obligatory Termitophile Corotoca melantho Schiødte (Coleoptera: Staphylinidae).png)
Sociobiology
OAAI
SociobiologyIF0
OAAIShareSaveShareSaveHighly Efficient Humidity Sensor Based on Sulfuric Acid Doped Polyaniline-Copper Oxide Composites
PREAI
ShareSaveShareSaveShareSave no more
no more