.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Computational phylogenetics
gene duplication
computations on discrete structures
linear-time algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
引用论文
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
OAAI分享收藏Highly Efficient Humidity Sensor Based on Sulfuric Acid Doped Polyaniline-Copper Oxide Composites
PREAI
分享收藏 没有更多内容
没有更多内容