DRIMust 1.0 – Discovering Ranked Imbalanced Motifs using suffix trees

DRIMust 1.0

:: DESCRIPTION

DRIMUST is a software implementation of a new statistical and algorithmic approach that we developed to enable efficient motif searches, covering a broader range of motif spaces comparing with state of the art motif searching tools. In particular, DRIMUST can efficiently search for variable gapped motifs, long motifs and motifs over large alphabets. The motif structure that DRIMUST searches comprises two half sites separated by a gap, that can be of a variable length.

Advertisement

::DEVELOPER

Yakhini Lab and the Mandel-Gutfreund Lab, at the Technion.

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Windows/Linux
  • JRE

:: DOWNLOAD

DRIMust

:: MORE INFORMATION

Citation

Nucleic Acids Res. 2013 Jul;41(Web Server issue):W174-9. doi: 10.1093/nar/gkt407. Epub 2013 May 17.
DRIMust: a web server for discovering rank imbalanced motifs using suffix trees.
Leibovich L1, Paz I, Yakhini Z, Mandel-Gutfreund Y.

Limor Leibovich, Zohar Yakhini:
Efficient motif search in ranked lists and applications to variable gap motifs.
Nucl. Acids Res. (2012) 40 (13): 5832-5847.