A Basis for Repeated Motifs in Pattern Discovery and Text Mining - Archive ouverte HAL Access content directly
Reports Year : 2002

A Basis for Repeated Motifs in Pattern Discovery and Text Mining

Nadia Pisanti
  • Function : Author
Roberto Grossi
  • Function : Author
Marie-France Sagot

Abstract

We present a new notion of basis that is able to generate the repeated motifs (possibly exponential in number) that appear at least twice with don't care symbols in a string of length n over an alphabet . Our basis has some interesting features such as being (a) a subset of the previously de ned bases, (b) truly linear as its motifs are less than n in number and appear in the string for a total of 2n times at most; (c) symmetric as the basis of the reversed string is the reverse of the basis; (d) computable in polynomial time, namely, in O(n log n log jj) time.
Fichier principal
Vignette du fichier
Hal.pdf (9.58 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00627828 , version 1 (29-09-2011)

Identifiers

  • HAL Id : hal-00627828 , version 1

Cite

Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot. A Basis for Repeated Motifs in Pattern Discovery and Text Mining. 2002. ⟨hal-00627828⟩
128 View
59 Download

Share

Gmail Facebook X LinkedIn More