String matching with alphabet sampling
From MaRDI portal
Publication:414445
DOI10.1016/j.jda.2010.09.004zbMath1237.68266OpenAlexW2109262879MaRDI QIDQ414445
Gonzalo Navarro, Jorma Tarhio, Francisco Claude, Hannu Peltola, Leena Salmela
Publication date: 11 May 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2010.09.004
Related Items (4)
Improved characters distance sampling for online and offline text searching ⋮ Efficient online string matching based on characters distance text sampling ⋮ Efficient processing of substring match queries with inverted variable-length gram indexes ⋮ Locally Compressed Suffix Arrays
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Replacing suffix trees with enhanced suffix arrays
- Speeding up two string-matching algorithms
- Suffix Arrays: A New Method for On-Line String Searches
- Compressed Text Indexes with Fast Locate
- Suffix Arrays on Words
- The Complexity of Pattern Matching for a Random String
- Fast Pattern Matching in Strings
- Compressed text indexes
This page was built for publication: String matching with alphabet sampling
