| 注册
首页|期刊导航|计算机与数字工程|基于贪心EM的模体预测算法

基于贪心EM的模体预测算法

张斐

计算机与数字工程2018,Vol.46Issue(6):1074-1077,1098,5.
计算机与数字工程2018,Vol.46Issue(6):1074-1077,1098,5.DOI:10.3969/j.issn.1672-9722.2018.06.002

基于贪心EM的模体预测算法

EM-based Greedy Algorithm for Motif Finding

张斐1

作者信息

  • 1. 陕西警官职业学院警察技术系 西安 710021
  • 折叠

摘要

Abstract

Motif finding algorithm was studied as the key point in this paper. Optimization was based on the EM-baced greedy algorithm and then predicting method was established. Parameters initialization,the re-division of the parameter model and intro?duction of Kd-tree hierarchical clustering method,and the establishment of PKGE algorithm were paid more attention in this paper. The results indicated PKGE algorithm has some advantages in predicting motifs in large data sets,especially in the prediction of se?quences in the same species. With advantages in sequence search and classification capabilities,the search efficiency was improved by PKGE algorithm significantly without changing complexity in the time.

关键词

Motif预测/贪心EM算法/PKGE算法

Key words

Motif finding/EM-based greedy algorithm/PKGE algorithm

分类

信息技术与安全科学

引用本文复制引用

张斐..基于贪心EM的模体预测算法[J].计算机与数字工程,2018,46(6):1074-1077,1098,5.

基金项目

国家自然科学基金项目(编号:61601107)资助. (编号:61601107)

计算机与数字工程

OACSTPCD

1672-9722

访问量0
|
下载量0
段落导航相关论文