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
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1754502 (Why is no real title available?)
- scientific article; zbMATH DE number 2087042 (Why is no real title available?)
- Compressed Text Indexes with Fast Locate
- Compressed text indexes, from theory to practice
- Fast Pattern Matching in Strings
- Replacing suffix trees with enhanced suffix arrays
- Speeding up two string-matching algorithms
- Suffix Arrays on Words
- Suffix Arrays: A New Method for On-Line String Searches
- The Complexity of Pattern Matching for a Random String
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
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)
