# HG changeset patch # User xuebing # Date 1333244332 14400 # Node ID 83fb93488cad74bdaf9d8334632f51ac4ba5f8c1 Uploaded diff -r 000000000000 -r 83fb93488cad dreme.xml --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/dreme.xml Sat Mar 31 21:38:52 2012 -0400 @@ -0,0 +1,50 @@ + + short motif discovery + /Users/xuebing/bin/dreme.py -p $input -png -e $ethresh + #if $background_select.bg_select == "fromfile": + -n "${bgfile}" + #end if + + && mv dreme_out/dreme.html ${html_outfile} + + && mv dreme_out/dreme.txt ${txt_outfile} + + && mv dreme_out/dreme.xml ${xml_outfile} + + && rm -rf dreme_out + + + + + + + + + + + + + + + + + + + + + + + + +**What it does** + +http://meme.sdsc.edu/meme/doc/dreme.html + +DREME (Discriminative Regular Expression Motif Elicitation) finds relatively short motifs (up to 8 bases) fast, and can perform discriminative motif discovery if given a negative set, consisting of sequences unlikely to contain a motif of interest that is however likely to be found in the main ("positive") sequence set. If you do not provide a negative set the program shuffles the positive set to provide a background (in the role of the negative set). + +The input to DREME is one or two sets of DNA sequences. The program uses a Fisher Exact Test to determine significance of each motif found in the postive set as compared with its representation in the negative set, using a significance threshold that may be set on the command line. + +DREME achieves its high speed by restricting its search to regular expressions based on the IUPAC alphabet representing bases and ambiguous characters, and by using a heuristic estimate of generalised motifs' statistical significance. + + +