AbstractDetection 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 met...
Transcription factor binding site (TFBS) motifs can be accurately represented by position frequency ...
Background: Familial binding profiles (FBPs) represent the average binding specificity for a group o...
For the motif discovery problem of DNA or protein sequences, a greedy two-stage Gibbs sampling algor...
AbstractDetection of over-represented motifs corresponding to known TFBSs (Transcription Factor Bind...
Algorithmic comparison of DNA sequence motifs is a problem in bioinformatics that has received incre...
One of the limiting factors in deciphering transcriptional regulatory networks is the effectiveness ...
Abstract. Many algorithms have been proposed to date for the problem of finding biologically signifi...
Abstract. Many algorithms have been proposed to date for the problem of finding biologically signifi...
Motivation: Finding common patterns, motifs, from a set of promoter regions of coregulated genes is ...
Background An important step in annotation of sequenced genomes is the identification of transcript...
Despite the remarkable success of computational biology methods in some areas of application like ge...
Abstract Background De novo prediction of Transcription Factor Binding Sites (TFBS) using computatio...
Abstract Recently, we performed an assessment of 13 popular computational tools for discovery of tra...
Motivation: The automatic identification of over-represented motifs present in a collection of seque...
A molecule called transcription factor usually binds to a set of promoter sequences of coexpressed g...
Transcription factor binding site (TFBS) motifs can be accurately represented by position frequency ...
Background: Familial binding profiles (FBPs) represent the average binding specificity for a group o...
For the motif discovery problem of DNA or protein sequences, a greedy two-stage Gibbs sampling algor...
AbstractDetection of over-represented motifs corresponding to known TFBSs (Transcription Factor Bind...
Algorithmic comparison of DNA sequence motifs is a problem in bioinformatics that has received incre...
One of the limiting factors in deciphering transcriptional regulatory networks is the effectiveness ...
Abstract. Many algorithms have been proposed to date for the problem of finding biologically signifi...
Abstract. Many algorithms have been proposed to date for the problem of finding biologically signifi...
Motivation: Finding common patterns, motifs, from a set of promoter regions of coregulated genes is ...
Background An important step in annotation of sequenced genomes is the identification of transcript...
Despite the remarkable success of computational biology methods in some areas of application like ge...
Abstract Background De novo prediction of Transcription Factor Binding Sites (TFBS) using computatio...
Abstract Recently, we performed an assessment of 13 popular computational tools for discovery of tra...
Motivation: The automatic identification of over-represented motifs present in a collection of seque...
A molecule called transcription factor usually binds to a set of promoter sequences of coexpressed g...
Transcription factor binding site (TFBS) motifs can be accurately represented by position frequency ...
Background: Familial binding profiles (FBPs) represent the average binding specificity for a group o...
For the motif discovery problem of DNA or protein sequences, a greedy two-stage Gibbs sampling algor...