The indexing for one-dimensional proportionally-scaled strings

DOI10.1016/j.ipl.2010.12.001zbMath1260.68491OpenAlexW1966733592MaRDI 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

zbMATH Keywords

design of algorithmsstring matchingscaleproportional

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• 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

This page was built for publication: The indexing for one-dimensional proportionally-scaled strings