Efficient text fingerprinting via Parikh mapping

DOI10.1016/S1570-8667(03)00035-2zbMath1100.68122MaRDI QIDQ1827267

Giorgio Satta, Amihood Amir, Gad M. Landau, Alberto Apostolico

Publication date: 6 August 2004

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

zbMATH Keywords

Design and analysis of algorithmsCombinatorial algorithms on words

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (18)

Permuted scaled matching ⋮ Indexing and querying color sets of images ⋮ Improved approximate common interval ⋮ ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS ⋮ Finding submasses in weighted strings with fast Fourier transform ⋮ Various improvements to text fingerprinting ⋮ Towards a theory of patches ⋮ Approximating the maximum consecutive subsums of a sequence ⋮ A PTAS for the square tiling problem ⋮ Efficient one-dimensional real scaled matching ⋮ Character sets of strings ⋮ New algorithms for text fingerprinting ⋮ Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings ⋮ On approximate jumbled pattern matching in strings ⋮ Faster query algorithms for the text fingerprinting problem ⋮ Indexing and querying character sets in one- and two-dimensional words ⋮ Orthogonal Range Searching for Text Indexing ⋮ Generalized mapping for multiset rewriting systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel construction of a suffix tree with applications
• Parallel Suffix–Prefix-Matching Algorithm and Applications
• On Context-Free Languages

This page was built for publication: Efficient text fingerprinting via Parikh mapping