Advertisement

Incremental Inference of Relational Motifs with a Degenerate Alphabet

  • Nadia Pisanti
  • Henry Soldano
  • Mathilde Carpentier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3537)

Abstract

In this paper we define a new class of problems that generalizes that of finding repeated motifs. The novelty lies in the addition of constraints on the motifs in terms of relations that must hold between pairs of elements of the motifs. For this class of problems we give an algorithm that is a suitable extension of the KMR [3] paradigm and, in particular, of the KMRC [7] as it uses a degenerate alphabet. The algorithm contains several improvements with respect to [7] that result especially useful when – as it is required for relational motifs – the inference is made by partially overlapping shorter motifs. The efficiency, correctness and completeness of the algorithm is assured by several non-trivial properties. Finally, we list some possible applications and we focus on one of them: the study of 3D structures of proteins.

Keywords

Input Sequence Repeated Motif Input Size Repeated Pattern Input Text 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    El-Zant, N., Soldano, H.: Finding repeated flexible relational words in sequences. Journal of Systemics, Cybernetics and Informatics 2(4) (2004)Google Scholar
  2. 2.
    Jones, N.C., Pevzner, P.A.: An Introduction to Bioinformatics Algorithms. The MIT Press, Cambridge (2004)Google Scholar
  3. 3.
    Karp, R., Miller, R., Rosenberg, A.: Rapid identification of repated patterns in strings, trees and arrays. In: Fourth ACM Symposium on Theory of Computing, pp. 125–136 (1972)Google Scholar
  4. 4.
    Lothaire, M.: Applied Combinatorics on words. Cambridge University Press, Cambridge (2005)zbMATHGoogle Scholar
  5. 5.
    Marsan, L., Sagot, M.-F.: Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory consensus identification. Journal of Computational Biology 7, 345–360 (2001)CrossRefGoogle Scholar
  6. 6.
    Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.-F.: A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 622–631. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Soldano, H., Viari, A., Champesme, M.: Searching for flexible repeated patterns using a non-transitive similarity relation. Pattern Recognition Letters 16, 243–246 (1995)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Nadia Pisanti
    • 1
    • 2
  • Henry Soldano
    • 1
    • 2
  • Mathilde Carpentier
    • 2
  1. 1.Laboratoire d’Informatique de l’Université Paris-Nord, UMR-CNRS 7030VilletaneuseFrance
  2. 2.Atelier de BioInformatiqueUniversité Paris 6Paris

Personalised recommendations