Finding Patterns in Given Intervals

Research output: Chapter in Book/Report/Conference proceedingConference paper

11 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2007
Subtitle of host publication32nd International Symposium, MFCS 2007 Cesky Krumlov, Czech Republic, August 26-31, 2007 Proceedings
EditorsL. Kuvcera, A. Kuvcera
PublisherSpringer-Verlag Berlin Heidelberg
Pages645-656
Number of pages12
ISBN (Print)9783540744559
DOIs
Publication statusPublished - 2007

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume4708
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Finding Patterns in Given Intervals'. Together they form a unique fingerprint.

Cite this