title: A heuristic cluster-based EM algorithm for the planted (l, d) problem.
abstract: The planted motif search problem arises from locating the transcription factor binding sites (TFBSs) which are crucial for understanding the gene regulatory relationship. Many attempts in using expectation maximization for TFBSs discovery are successful in past. However, identifying highly degenerate motifs and reducing the effect of local optima are still an arduous task. To alleviate the vulnerability of EM to local optima trapping, we present a heuristic cluster-based EM algorithm, CEM, which refines the cluster subsets in EM method to explore the best local optimal solution. Based on experiments using both synthetic and real datasets, our algorithm demonstrates significant improvements in identifying the motif instances and performs better than current widely used algorithms. CEM is a novel planted motif finding algorithm, which is able to solve the challenging instances and easy to parallel since the process of solving each cluster subset is independent.
authors.affiliation: Department of Computer Science, Xidian University, Xi'an, 710071, Shaanxi, P. R. China. zephyr26026@gmail.com.
authors.forename: Yipu
authors.initials: Y
authors.lastname: Zhang
authors.forename: Hongwei
authors.initials: H
authors.lastname: Huo
authors.forename: Qiang
authors.initials: Q
authors.lastname: Yu
mesh_terms: D000465:Algorithms; D001665:Binding Sites; D016000:Cluster Analysis; D014157:Transcription Factors / Q000737:chemistry* / Q000378:metabolism
chemical_list: D014157:Transcription Factors