Finding Patterns in Given Intervals - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Finding Patterns in Given Intervals

Résumé

In this paper, we study the pattern matching problem in given intervals. Depending on whether the intervals are given a priori for pre-processing, or during the query along with the pattern or, even in both cases, we develop solutions for different variants of this problem. In particular, we present efficient indexing schemes for each of the above variants of the problem.
Fichier principal
Vignette du fichier
Finding_Patterns_In_Given_Intervals.pdf (149.16 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00620133 , version 1 (14-02-2013)

Identifiants

  • HAL Id : hal-00620133 , version 1

Citer

Maxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman. Finding Patterns in Given Intervals. Mathematical Foundations of Computer Science (MFCS'07), 2007, Czech Republic. pp.645-656. ⟨hal-00620133⟩
106 Consultations
494 Téléchargements

Partager

Gmail Facebook X LinkedIn More