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 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00620133
Contributor : Maxime Crochemore <>
Submitted on : Thursday, February 14, 2013 - 5:26:02 PM
Last modification on : Thursday, April 19, 2018 - 2:24:03 PM
Long-term archiving on: Wednesday, May 15, 2013 - 2:30:09 AM

File

Finding_Patterns_In_Given_Inte...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00620133, version 1

Collections

Citation

Maxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman. Finding Patterns in Given Intervals. Mathematical Foundations of Computer Science (MFCS'07), 2007, Czech Republic. pp.645-656. ⟨hal-00620133⟩

Share

Metrics

Record views

253

Files downloads

428