[1]陈昆张小骏.AP聚类算法求解植入(l，d）模体识别问题[J].郑州大学学报(工学版),2015,36(03):110-114.[doi:10.3969/j. issn.1671 -6833.2015.03.024]
　CHEN Kun,ZHANG Xiao-jun.AP Clustering Algorithm Solving Planted (L, d )Motif Identification[J].Journal of Zhengzhou University (Engineering Science),2015,36(03):110-114.[doi:10.3969/j. issn.1671 -6833.2015.03.024]
点击复制

AP聚类算法求解植入(l，d）模体识别问题()
分享到：

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:
36
期数:
2015年03期
页码:
110-114
栏目:
出版日期:
2015-06-30

文章信息/Info

Title:
AP Clustering Algorithm Solving Planted (L, d )Motif Identification
作者:
陈昆1张小骏2
西安电子科技大学计算机系﹐陕西西安710071
Author(s):
CHEN Kun; ZHANG Xiao-jun
School of Computer Science,Xidian University,Xi’an 710071,China
关键词:
基因转录; 模体识别; AP聚类算法
Keywords:
gene transcription ;  motif identification;  AP clustering algorithm
分类号:
TP39
DOI:
10.3969/j. issn.1671 -6833.2015.03.024
文献标志码:
A
摘要:
模体识别是运用计算机算法寻找一系列功能相近且形式相似的DNA序列片段,从而找出生物信息学中控制基因表达调控机制的转录因子结合位点,将这种问题转化为AP聚类算法可处理的模型，然后用AP聚类得到稳定的候选模体聚类,最终利用贪心算法对问题进行求精,得出一组候选模体集,利用相对嫡测度对候选模体集合进行评价并且择优输出,从而构造出一种新的模体识别算法.实验结果分别从模拟数据和真实数据证明了所提算法的有效性.
Abstract:
Transcription factors can be combined with the special DNA sequence that can control gene tran-scription process.The special DNA sequence is called the motifs.The motif identification is to find a set ofDNA fragments with both similar functions and similar forms. It plays a crucial role in the research on thestructure and function of genes.The problem was converted to the model which can be processed by AP cluste-ring algorithm.Then we get steady candidate motifs by using AP clustering.Finally we use the greedy algo-rithm to refine the clustering results.We can get a group of candidate motifs set,evaluate candidate motifs setby information content and output the optimal motif set.Thereby the new algorithm is designed for the prob-lem. The experimental results on both simulated data and real data demonstrate the validity of the proposed al-gorithm.
更新日期/Last Update: