String matching with alphabet sampling
From MaRDI portal
Publication:414445
DOI10.1016/J.JDA.2010.09.004zbMATH Open1237.68266OpenAlexW2109262879MaRDI QIDQ414445FDOQ414445
Authors: Francisco Claude, Gonzalo Navarro, Hannu Peltola, Leena Salmela, Jorma Tarhio 
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
Recommendations
- Improved characters distance sampling for online and offline text searching
- Efficient online string matching based on characters distance text sampling
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Approximate string matching with reduced alphabet
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compressed text indexes, from theory to practice
- Speeding up two string-matching algorithms
- Suffix Arrays: A New Method for On-Line String Searches
- Fast Pattern Matching in Strings
- Compressed Text Indexes with Fast Locate
- Replacing suffix trees with enhanced suffix arrays
- The Complexity of Pattern Matching for a Random String
- Title not available (Why is that?)
- Suffix Arrays on Words
Cited In (6)
- An approximation algorithm for alphabet indexing problem
- Fast matching statistics in small space
- Locally compressed suffix arrays
- Improved characters distance sampling for online and offline text searching
- Efficient processing of substring match queries with inverted variable-length gram indexes
- Efficient online string matching based on characters distance text sampling
Uses Software
This page was built for publication: String matching with alphabet sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414445)
