Faster query algorithms for the text fingerprinting problem
From MaRDI portal
Publication:549671
DOI10.1016/J.IC.2011.04.001zbMATH Open1216.68352OpenAlexW2059372536MaRDI QIDQ549671FDOQ549671
Biing-Feng Wang, Wing-Kai Hon, Chi-Yuan Chan, Hung-I Yu
Publication date: 18 July 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.04.001
Recommendations
Cites Work
- Title not available (Why is that?)
- The string B-tree
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Title not available (Why is that?)
- Efficient text fingerprinting via Parikh mapping
- Fast Algorithms for Finding Nearest Common Ancestors
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Character sets of strings
- New algorithms for text fingerprinting
- Deterministic dictionaries
- New Algorithms for Text Fingerprinting
- Combinatorial Pattern Matching
- Improved approximate common interval
Cited In (7)
- New Algorithms for Text Fingerprinting
- A Faster Query Algorithm for the Text Fingerprinting Problem
- Indexing and querying color sets of images
- Various improvements to text fingerprinting
- Indexing and querying character sets in one- and two-dimensional words
- Efficient text fingerprinting via Parikh mapping
- 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)