New algorithms for text fingerprinting

DOI10.1016/J.JDA.2007.05.001MaRDI QIDQ935841zbMATH OpenOpenAlexFDO

Authors Mathieu Raffinot, Roman 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

character setmaximal locationnamingtext algorithmtext fingerprinting

Mathematics Subject Classification ID

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

Recommendations

• New Algorithms for Text Fingerprinting
• Various improvements to text fingerprinting
• Faster query algorithms for the text fingerprinting problem
• A Faster Query Algorithm for the Text Fingerprinting Problem
• Efficient text fingerprinting via Parikh mapping

Cites work

• Algorithms – ESA 2005
• Character sets of strings
• Efficient text fingerprinting via Parikh mapping
• Fast algorithms to enumerate all common intervals of two permutations
• scientific article; zbMATH DE number 1786460 (Why is no real title available?)
• Introduction to algorithms

Cited in

(10)

• Information recovery from randomly mixed-up message text
• Indexing and querying character sets in one- and two-dimensional words
• Efficient text fingerprinting via Parikh mapping
• Character sets of strings
• Indexing and querying color sets of images
• A Faster Query Algorithm for the Text Fingerprinting Problem
• Various improvements to text fingerprinting
• Extending common intervals searching from permutations to sequences
• New Algorithms for Text Fingerprinting
• Faster query algorithms for the text fingerprinting problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935841)