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 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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Crochemore, M., Iliopoulos, C. S., & Sohel Rahman, M. (2007). Finding patterns in given intervals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 645–656). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
