Indexing and querying character sets in one- and two-dimensional words

DOI10.1007/s10958-018-3921-yzbMath1398.68700OpenAlexW2810932469MaRDI QIDQ1791759

Djamal Belazzougui, Mathieu Raffinot, Roman M. Kolpakov

Publication date: 11 October 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-018-3921-y

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Indexing and querying color sets of images
• Various improvements to text fingerprinting
• Faster query algorithms for the text fingerprinting problem
• Replacing suffix trees with enhanced suffix arrays
• New algorithms for text fingerprinting
• Efficient text fingerprinting via Parikh mapping
• Character sets of strings
• An Optimal Bloom Filter Replacement Based on Matrix Solving
• A Space-Economical Suffix Tree Construction Algorithm
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• New Algorithms for Text Fingerprinting

This page was built for publication: Indexing and querying character sets in one- and two-dimensional words