Faster query algorithms for the text fingerprinting problem
From MaRDI portal
(Redirected from Publication:549671)
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- Character sets of strings
- Combinatorial Pattern Matching
- Deterministic dictionaries
- Efficient text fingerprinting via Parikh mapping
- Fast Algorithms for Finding Nearest Common Ancestors
- Improved approximate common interval
- New Algorithms for Text Fingerprinting
- New algorithms for text fingerprinting
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- The string B-tree
Cited in
(9)- New Algorithms for Text Fingerprinting
- Efficient text fingerprinting via Parikh mapping
- New algorithms for text fingerprinting
- A Faster Query Algorithm for the Text Fingerprinting Problem
- Various improvements to text fingerprinting
- Indexing and querying color sets of images
- On building minimal automaton for subset matching queries
- Indexing and querying character sets in one- and two-dimensional words
- Character sets of strings
This page was built for publication: Faster query algorithms for the text fingerprinting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549671)