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

• Type: Conference
• Year: 2007
• Where: MFCS
• Authors: Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman
• Keywords: Different Variants, MFCS 2007, Pattern Matching Problem