New algorithms for text fingerprinting

DOI10.1016/J.JDA.2007.05.001zbMath1175.68545OpenAlexW2001571332MaRDI QIDQ935841

Mathieu Raffinot, Roman M. Kolpakov

Publication date: 8 August 2008

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

Full work available at URL: https://doi.org/10.1016/j.jda.2007.05.001

zbMATH Keywords

namingcharacter setmaximal locationtext algorithmtext fingerprinting

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items (5)

Indexing and querying color sets of images ⋮ Various improvements to text fingerprinting ⋮ Extending common intervals searching from permutations to sequences ⋮ Faster query algorithms for the text fingerprinting problem ⋮ Indexing and querying character sets in one- and two-dimensional words

Cites Work

• Efficient text fingerprinting via Parikh mapping
• Fast algorithms to enumerate all common intervals of two permutations
• Character sets of strings
• Algorithms – ESA 2005
• Unnamed Item
• Unnamed Item

This page was built for publication: New algorithms for text fingerprinting