Finding Patterns in Given Intervals

Maxime Crochemore (1, 2) , Costas Iliopoulos (1) , Marcin Kubica (3) , Mohammad Sohel Rahman (1) , Tomasz Walen (3)

1 Informatics
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 Institute of Informatics [Warsaw]

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 the cases, we develop efficient solutions for different variants of this problem. In particular, we present efficient indexing schemes for each of the above variants of the problem.

Domaines: Algorithme et structure de données [cs.DS]

Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen. Finding Patterns in Given Intervals. Fundamenta Informaticae, 2010, 101 (3), pp.173-186. ⟨10.3233/FI-2010-283⟩. ⟨hal-00742042⟩