Background: Extracting motifs from sequences is a mainstay of bioinformatics. We look at the problem of mining structured motifs, which allow variable length gaps between simple motif components. We propose an efficient algorithm, called EXMOTIF, that given some sequence(s), and a structured motif template, extracts all frequent structured motifs that have quorum q. Potential applications of our method include the extraction of single/composite regulatory binding sites in DNA sequences. Results: EXMOTIF is efficient in terms of both time and space and is shown empirically to outperform RISO, a state-of-the-art algorithm. It is also successful in finding potential single/ composite transcription factor binding sites. Conclusion: EXMOTIF is a useful and efficient tool in discovering structured motifs, especially in DNA sequences. The algorithm is available as open-source at
This simplified version of the problem is called Frequent (Structured) Motif Discovery problem REF .
EXMOTIF: efficient structured motif extraction
Algorithms for Molecular Biology
Algorithms for Molecular Biology
Medicine Computer Science