Skip to main content
. 2012 Mar 13;40(13):5832–5847. doi: 10.1093/nar/gks206

Figure 1.

Figure 1.

Scheme of DRIMUST for VGMs. First, a generalized suffix tree for Inline graphic is constructed. Then, for every path Inline graphic at depth Inline graphic we build a generalized suffix tree Inline graphic for all strings of length Inline graphic rooted below P. Finally, paths Q at depth Inline graphic in Inline graphic are traversed, and all motifs Inline graphic, where Inline graphic, are evaluated.