Finding patterns in given intervals

Authors:
Maxime Crochemore;Costas S. Iliopoulos;M. Sohel Rahman
Affiliations:
Department of Computer Science, King's College London, Strand, London, England and Institut Gaspard-Monge, University of Marne-la-Vallée, France;Department of Computer Science, King's College London, Strand, London, England;Department of Computer Science, King's College London, Strand, London, England
Venue:
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Year:
2007

Citing 18
Cited 8

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Real scaled matching

Information Processing Letters
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
Verifying candidate matches in sparse and wildcard matching

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Range Searching in Categorical Data: Colored Range Searching on Grid

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Two-dimensional pattern matching with rotations

Theoretical Computer Science
Dictionary matching and indexing with errors and don't cares

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Pattern matching with address errors: rearrangement distances

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Succinct data structures for flexible text retrieval systems

Journal of Discrete Algorithms
Scaled and permuted string matching

Information Processing Letters
Property matching and weighted matching

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Faster two dimensional scaled matching

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Finding patterns with variable length gaps or don’t cares

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Position-Restricted substring searching

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Optimal prefix and suffix queries on texts

Information Processing Letters
Efficient Data Structures for the Orthogonal Range Successor Problem

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Faster entropy-bounded compressed suffix trees

Theoretical Computer Science
Finding Patterns In Given Intervals

Fundamenta Informaticae
Improved data structures for the orthogonal range successor problem

Computational Geometry: Theory and Applications
New algorithms on wavelet trees and applications to information retrieval

Theoretical Computer Science
Improved algorithms for the range next value problem and applications

Theoretical Computer Science
Sorted range reporting

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

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.