EM-based Greedy Algorithm for Motif Finding
ZHANG Fei
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.
Keywords：Motif findingEM-based greedy algorithmPKGE algorithm
Publication Date：2018-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 1074-1077,1098 )