| Summary: | <p>Abstract</p> <p>Background</p> <p>Although dozens of algorithms and tools have been developed to find a set of <it>cis</it>-regulatory binding sites called a motif in a set of intergenic sequences using various approaches, most of these tools focus on identifying binding sites that are significantly different from their background sequences. However, some motifs may have a similar nucleotide distribution to that of their background sequences. Therefore, such binding sites can be missed by these tools.</p> <p>Results</p> <p>Here, we present a graph-based polynomial-time algorithm, MotifClick, for the prediction of <it>cis</it>-regulatory binding sites, in particular, those that have a similar nucleotide distribution to that of their background sequences. To find binding sites with length <it>k</it>, we construct a graph using some 2(<it>k</it>-1)-mers in the input sequences as the vertices, and connect two vertices by an edge if the maximum number of matches of the local gapless alignments between the two 2(<it>k</it>-1)-mers is greater than a cutoff value. We identify a motif as a set of similar <it>k</it>-mers from a merged group of maximum cliques associated with some vertices.</p> <p>Conclusions</p> <p>When evaluated on both synthetic and real datasets of prokaryotes and eukaryotes, MotifClick outperforms existing leading motif-finding tools for prediction accuracy and balancing the prediction sensitivity and specificity in general. In particular, when the distribution of nucleotides of binding sites is similar to that of their background sequences, MotifClick is more likely to identify the binding sites than the other tools.</p>
|
|---|
