Efficient indexing algorithms for one-dimensional discretely-scaled strings
From MaRDI portal
Publication:765528
DOI10.1016/j.ipl.2010.05.012zbMath1234.68480OpenAlexW1969880101MaRDI QIDQ765528
Kuo-Si Huang, Chang-Biau Yang, Yung-Hsing Peng, Hsing-Yen Ann
Publication date: 19 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.012
Related Items
Cites Work
- Unnamed Item
- Real two dimensional scaled 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
- Efficient pattern matching with scaling
- Fast Pattern Matching in Strings
- Efficient algorithms for the scaled indexing problem
- On the sorting-complexity of suffix tree construction