New Algorithms for Text Fingerprinting

DOI10.1007/11780441_31MaRDI QIDQ5307518zbMATH OpenOpenAlexFDO

Authors Mathieu Raffinot, Roman Kolpakov

Publication date 14 September 2007

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780441_31

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• New algorithms for text fingerprinting
• Various improvements to text fingerprinting
• A Faster Query Algorithm for the Text Fingerprinting Problem
• Faster query algorithms for the text fingerprinting problem
• Efficient text fingerprinting via Parikh mapping
• Information Security Practice and Experience
• scientific article; zbMATH DE number 2044549
• scientific article; zbMATH DE number 801745

Cited in

(9)

• 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
• Improved approximate common interval
• Character sets of strings
• A Faster Query Algorithm for the Text Fingerprinting Problem
• Various improvements to text fingerprinting
• Faster query algorithms for the text fingerprinting problem
• New algorithms for text fingerprinting

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 Q5307518)