Efficient indexing algorithms for one-dimensional discretely-scaled strings

The discretely-scaled string indexing problem asks one to preprocess a given text string T, so that for a queried pattern P, the matched positions in T that P appears with some discrete scale can be reported efficiently. For solving this problem, Wang et al. first show that with an O(|T|log|T|)-time preprocessing on T, all matched positions can be reported in O(|P|+U"d) time, where |T|, |P|, and U"d denote the length of T, the length of P, and the number of matched positions for discretely-scaled P in T, respectively. In this paper, for fixed alphabets we propose the first-known optimal indexing algorithm that takes O(|T|) and O(|P|+U"d) time in its preprocessing and query phases, respectively. For integer and unbounded alphabets, our new algorithm can also be extended to obtain the best-known results.

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

[2]  Chang-Biau Yang,et al.  Efficient Indexing for One-dimensional Proportionally-scaled Patterns , 2009 .

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

[4]  Biing-Feng Wang,et al.  Efficient algorithms for the scaled indexing problem , 2004, J. Algorithms.

[5]  Moshe Lewenstein,et al.  Real Two Dimensional Scaled Matching , 2007, Algorithmica.

[6]  Wing-Kai Hon,et al.  The SBC-tree: an index for run-length compressed sequences , 2008, EDBT '08.

[7]  Stephen Alstrup,et al.  New data structures for orthogonal range searching , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[8]  Dong Kyue Kim,et al.  Constructing suffix arrays in linear time , 2005, J. Discrete Algorithms.

[9]  Gad M. Landau,et al.  Efficient pattern matching with scaling , 1990, SODA '90.

[10]  Chang-Biau Yang,et al.  A new efficient indexing algorithm for one-dimensional real scaled patterns , 2012, J. Comput. Syst. Sci..

[11]  S. Muthukrishnan,et al.  On the sorting-complexity of suffix tree construction , 2000, JACM.

[12]  Uzi Vishkin,et al.  Matching Patterns in Strings Subject to Multi-Linear Transformations , 1988, Theor. Comput. Sci..

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

[14]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[15]  M. Crochemore,et al.  On-line construction of suffix trees , 2002 .

[16]  Moshe Lewenstein,et al.  Efficient one-dimensional real scaled matching , 2007, J. Discrete Algorithms.