Advertisement

L-SME: A System for Mining Loosely Structured Motifs

  • Fabio Fassetti
  • Gianluigi Greco
  • Giorgio Terracina
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6913)

Abstract

We present L-SME, a system to efficiently identify loosely structured motifs in genome-wide applications. L-SME is innovative in three aspects. Firstly, it handles wider classes of motifs than earlier motif discovery systems, by supporting boxes swaps and skips in the motifs structure as well as various kinds of similarity functions. Secondly, in addition to the standard exact search, it supports search via randomization in which guarantees on the quality of the results can be given a-priori based on user-definable resource (time and space) constraints. Finally, L-SME comes equipped with an intuitive graphical interface through which the structure for the motifs of interest can be defined, the discovery method can be selected, and results can be visualized. The tool is flexible and scalable, by allowing genome-wide searches for very complex motifs and is freely accessible at http://siloe.deis.unical.it/l-sme. A detailed description of the algorithms underlying L-SME is available in [1].

Keywords

Complex Motif Motif Discovery Model Template Pattern Instance Levenshtein Distance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Fassetti, F., Greco, G., Terracina, G.: Mining loosely structured motifs from biological data. IEEE Transaction on Knowledge and Data Engineering 20(11), 1472–1489 (2008)CrossRefGoogle Scholar
  2. 2.
    Hughes, J.D., Estep, P.W., Tavazoie, S., Church, G.M.: Computational identification of cis-regulatory elements associated with groups of functionally related genes in saccharomyces cerevisiae. Journal of Molecular Biology 296(5), 1205–1214 (2000)CrossRefGoogle Scholar
  3. 3.
    Marsan, L., Sagot, M.-F.: Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. Journal of Computational Biology 7(3-4), 345–362 (2000)CrossRefGoogle Scholar
  4. 4.
    Osanai, M., Takahashi, H., Kojima, K.K., Hamada, M., Fujiwara, H.: Essential motifs in the 3’ untranslated region required for retrotransposition and the precise start of reverse transcription in non-long-terminal-repeat retrotransposon SART1. Mol. Cell. Biol. 24(19), 7902–7913 (2004)CrossRefGoogle Scholar
  5. 5.
    Sandve, G.K., Drabls, F.: A survey of motif discovery methods in an integrated framework. Biology Direct 1(11), 1–16 (2006)Google Scholar
  6. 6.
    Sinha, S., Tompa, M.: YMF: A program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acid Research 31(13), 3586–3588 (2003)CrossRefGoogle Scholar
  7. 7.
    Tu, Z., Li, S., Mao, C.: The changing tails of a novel short interspersed element in aedes aegypti: genomic evidence for slippage retrotransposition and the relationship between 3’ tandem repeats and the poly(da) tail. Genetics 168(4), 2037–2047 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Fabio Fassetti
    • 1
  • Gianluigi Greco
    • 2
  • Giorgio Terracina
    • 2
  1. 1.ICAR-CNRItaly
  2. 2.Dep. of MathematicsRendeItaly

Personalised recommendations