The indexing for one-dimensional proportionally-scaled strings
From MaRDI portal
Publication:1944891
DOI10.1016/j.ipl.2010.12.001zbMath1260.68491MaRDI QIDQ1944891
Chang-Biau Yang, Chiou-Yi Hor, Chiou-Ting Tseng, Yung-Hsing Peng
Publication date: 28 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.12.001
Cites Work
- Efficient indexing algorithms for one-dimensional discretely-scaled strings
- Simple deterministic wildcard matching
- Matching patterns in strings subject to multi-linear transformations
- Real scaled matching
- On-line construction of suffix trees
- Efficient one-dimensional real scaled matching
- Constructing suffix arrays in linear time
- Suffix Arrays: A New Method for On-Line String Searches
- Efficient pattern matching with scaling
- Fast Pattern Matching in Strings
- Alphabet-Independent and Scaled Dictionary Matching
- Faster algorithms for string matching with k mismatches
- Efficient algorithms for the scaled indexing problem
- On the sorting-complexity of suffix tree construction
- Unnamed Item