Various improvements to text fingerprinting

DOI10.1016/j.jda.2013.06.004zbMath1334.68312arXiv1301.3488OpenAlexW2044083820MaRDI QIDQ396662

Djamal Belazzougui, Mathieu Raffinot, Roman M. Kolpakov

Publication date: 13 August 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.3488

zbMATH Keywords

indexingtext algorithmsnamingcharacter sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Algorithms on strings (68W32)

Related Items (2)

Indexing and querying color sets of images ⋮ Indexing and querying character sets in one- and two-dimensional words

Cites Work

• Unnamed Item
• Unnamed Item
• Faster query algorithms for the text fingerprinting problem
• New algorithms for text fingerprinting
• Efficient text fingerprinting via Parikh mapping
• Character sets of strings
• An Optimal Bloom Filter Replacement Based on Matrix Solving
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• A Faster Query Algorithm for the Text Fingerprinting Problem
• Bloomier Filters: A Second Look
• Efficient randomized pattern-matching algorithms
• 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: Various improvements to text fingerprinting