Affiliations: Algorithm Design Group, King’s College London, Strand, London WC2R 2LS, U.K. [email protected] | Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland. [email protected] | Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland. [email protected] | Algorithm Design Group, King’s College London, Strand, London WC2R 2LS, U.K. [email protected] | AlEDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh. [email protected]
Note: [] Address for correspondence: AlEDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh
Abstract: 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.
Keywords: algorithms, data structures, pattern matching, strings
