Finding Patterns in Given Intervals - Archive ouverte HAL Access content directly
Journal Articles Fundamenta Informaticae Year : 2010

Finding Patterns in Given Intervals


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.
No file

Dates and versions

hal-00742042 , version 1 (15-10-2012)



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⟩
98 View
0 Download



Gmail Facebook Twitter LinkedIn More