Finding Patterns In Given Intervals

Authors:
Maxime Crochemore;Marcin Kubica;Tomasz Waleń;Costas S. Iliopoulos;M. Sohel Rahman
Affiliations:
Algorithm Design Group, King’s College London, Strand, London WC2R 2LS, U.K. Maxime.Crochemore@kcl.ac.uk;Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland. kubica@mimuw.edu.pl;Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland. walen@mimuw.edu.pl;Algorithm Design Group, King’s College London, Strand, London WC2R 2LS, U.K. csi@dcs.kcl.ac.uk;(Correspd.) AlEDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh. msrahman@cse.buet.ac.bd
Venue:
Fundamenta Informaticae
Year:
2010

Citing 30
Cited 2

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
Highly parallelizable problems

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
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)
A fast algorithm for computing longest common subsequences

Communications of the ACM
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
Faster index for property matching

Information Processing Letters
Indexing Factors with Gaps

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A New Efficient Algorithm for Computing the Longest Common Subsequence

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Indexing Factors with Gaps

Algorithmica
A New Efficient Algorithm for Computing the Longest Common Subsequence

Theory of Computing Systems - Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler
Scaled and permuted string matching

Information Processing Letters
Two-dimensional pattern matching with rotations

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
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
Finding patterns in given intervals

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
A new succinct representation of RMQ-information and improvements in the enhanced suffix array

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Substring range reporting

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Improved algorithms for the range next value problem and applications

Theoretical Computer Science

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