Dynamic dictionary matching in external memory
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3653523 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1263248 (Why is no real title available?)
- scientific article; zbMATH DE number 1306895 (Why is no real title available?)
- scientific article; zbMATH DE number 871935 (Why is no real title available?)
- scientific article; zbMATH DE number 910912 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms for parallel memory, I: Two-level memories
- Alphabet dependence in parameterized matching
- Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries
- Dynamic dictionary matching
- Dynamic dictionary matching with failure functions
- Efficient string matching
- Improved dynamic dictionary matching
- Multiple matching of parameterized patterns
- On the parallel dynamic dictionary matching problem: new results with applications
- Parameterized pattern matching: Algorithms and applications
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(4)
This page was built for publication: Dynamic dictionary matching in external memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275745)
