Finding Patterns In Given Intervals

Maxime Crochemore; Marcin Kubica; Tomasz Walen; Costas S. Iliopoulos; M. Sohel Rahman

doi:10.3233/FI-2010-283

Finding Patterns In Given Intervals

Maxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman

Informatics

Research output: Contribution to journal › Article › peer-review

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

Original language	English
Pages (from-to)	173 - 186
Number of pages	14
Journal	FUNDAMENTA INFORMATICAE
Volume	101
Issue number	3
DOIs	https://doi.org/10.3233/FI-2010-283
Publication status	Published - 2010

Access to Document

10.3233/FI-2010-283

Cite this

@article{7eab83d8777e4352b1a795df6647c109,

title = "Finding Patterns In Given Intervals",

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

author = "Maxime Crochemore and Marcin Kubica and Tomasz Walen and Iliopoulos, {Costas S.} and Rahman, {M. Sohel}",

year = "2010",

doi = "10.3233/FI-2010-283",

language = "English",

volume = "101",

pages = "173 -- 186",

journal = "FUNDAMENTA INFORMATICAE",

publisher = "IOS Press",

number = "3",

}

TY - JOUR

T1 - Finding Patterns In Given Intervals

AU - Crochemore, Maxime

AU - Kubica, Marcin

AU - Walen, Tomasz

AU - Iliopoulos, Costas S.

AU - Rahman, M. Sohel

PY - 2010

Y1 - 2010

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

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

U2 - 10.3233/FI-2010-283

DO - 10.3233/FI-2010-283

M3 - Article

VL - 101

SP - 173

EP - 186

JO - FUNDAMENTA INFORMATICAE

JF - FUNDAMENTA INFORMATICAE

IS - 3

ER -

Finding Patterns In Given Intervals

Abstract

Access to Document

Fingerprint

Cite this