Detection of over-represented motifs corresponding to known TFBSs via motif clustering and matching

Authors:
Li-fang Liu;Li-cheng Jiao
Affiliations:
School of Computer Science and Technology, Xidian University, Xi'an 710071, China and Institute of Intelligent Information Processing, Xidian University, Xi'an 710071, China;Institute of Intelligent Information Processing, Xidian University, Xi'an 710071, China
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 7
Cited 0

Unsupervised Learning of Multiple Motifs in Biopolymers Using Expectation Maximization

Machine Learning - Special issue on applications in molecular biology
Similarity of position frequency matrices for transcription factor binding sites

Bioinformatics
Transcription factor binding site identification using the self-organizing map

Bioinformatics
Combining phylogenetic motif discovery and motif clustering to predict co-regulated genes

Bioinformatics
Regulatory Motif Discovery Using a Population Clustering Evolutionary Algorithm

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A profile-based deterministic sequential Monte Carlo algorithm for motif discovery

Bioinformatics
Natural similarity measures between position frequency matrices with an application to clustering

Bioinformatics

Quantified Score

Hi-index	0.09

Visualization

Abstract

Detection of over-represented motifs corresponding to known TFBSs (Transcription Factor Binding Sites) is an important problem in biological sequences analysis. In this paper, a novel motif discovery method based on motif clustering and matching is proposed. Against a precompiled library of motifs described as position weight matrices (PWMs), eachL-mer in the data set is matched to a motif base on the match score's p-value, and then the PWMs are updated and clustered according to their similarity. Motif features are ranked in terms of statistical significance (p-value). We present an implementation of this approach, named MotifCM, which is capable of discovering multiple distinct motifs present in a single data set. We apply our method to the benchmark which has 56 data sets, and demonstrate that the performance of MotifCM on this data set compares well to, and in many cases exceeds, the performance of existing tools.