Finding Patterns In Given Intervals

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.

[1]  Michael A. Bender,et al.  The LCA Problem Revisited , 2000, LATIN.

[2]  Wojciech Rytter,et al.  Jewels of stringology , 2002 .

[3]  R. Maraia,et al.  The impact of short interspersed elements (SINEs) on the host genome , 1995 .

[4]  Martin Farach-Colton,et al.  Optimal Suffix Tree Construction with Large Alphabets , 1997, FOCS.

[5]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[6]  Richard Cole,et al.  Dictionary matching and indexing with errors and don't cares , 2004, STOC '04.

[7]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[8]  Moshe Lewenstein,et al.  Real scaled matching , 2000, SODA '00.

[9]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[10]  Wojciech Rytter,et al.  Jewels of stringology : text algorithms , 2002 .

[11]  Tsvi Kopelowitz,et al.  Property matching and weighted matching , 2006, Theor. Comput. Sci..

[12]  Amihood Amir,et al.  Faster Two Dimensional Scaled Matching , 2008, Algorithmica.

[13]  Richard Cole,et al.  Verifying candidate matches in sparse and wildcard matching , 2002, STOC '02.

[14]  Steven Skiena,et al.  Pattern matching with address errors: rearrangement distances , 2006, SODA '06.

[15]  Gad M. Landau,et al.  Scaled and permuted string matching , 2004, Inf. Process. Lett..

[16]  M. Fischer,et al.  STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[17]  Kunihiko Sadakane,et al.  Succinct data structures for flexible text retrieval systems , 2007, J. Discrete Algorithms.

[18]  Costas S. Iliopoulos,et al.  Finding Patterns with Variable Length Gaps or Don't Cares , 2006, COCOON.

[19]  Esko Ukkonen,et al.  On-line construction of suffix trees , 1995, Algorithmica.

[20]  Daniel S. Hirschberg,et al.  Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[21]  Amihood Amir,et al.  Faster two-dimensional pattern matching with rotations , 2006, Theor. Comput. Sci..

[22]  Gad M. Landau,et al.  Two-dimensional pattern matching with rotations , 2004, Theor. Comput. Sci..

[23]  Pankaj K. Agarwal,et al.  Range Searching in Categorical Data: Colored Range Searching on Grid , 2002, ESA.

[24]  Gonzalo Navarro,et al.  Position-Restricted Substring Searching , 2006, LATIN.

[25]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .