A new efficient indexing algorithm for one-dimensional real scaled patterns
From MaRDI portal
Publication:414881
DOI10.1016/J.JCSS.2011.05.001zbMath1237.68270OpenAlexW1980324283MaRDI QIDQ414881
Chiou-Yi Hor, Yung-Hsing Peng, Chiou-Ting Tseng, Chang-Biau Yang
Publication date: 11 May 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2011.05.001
Cites Work
- Unnamed Item
- Unnamed Item
- Simple deterministic wildcard matching
- Real two dimensional scaled matching
- Real scaled matching
- On-line construction of suffix trees
- Efficient one-dimensional real scaled matching
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- A fast string searching algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Efficient pattern matching with scaling
- A Space-Economical Suffix Tree Construction Algorithm
- 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: A new efficient indexing algorithm for one-dimensional real scaled patterns
