Efficient text fingerprinting via Parikh mapping
type: Item
instance of: scholarly article
title: Efficient text fingerprinting via Parikh mapping
zbMATH Open document ID: 1100.68122
DOI: 10.1016/S1570-8667(03)00035-2
author: Amihood Amir
author: Alberto Apostolico
author: Gad M. Landau
author: Giorgio Satta
published in: Journal of Discrete Algorithms
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 2082300
zbMATH Keywords: Design and analysis of algorithms
zbMATH Keywords: Combinatorial algorithms on words
MaRDI profile type: Publication
cites work: Parallel construction of a suffix tree with applications
cites work: Q4125823
cites work: Parallel Suffix–Prefix-Matching Algorithm and Applications
cites work: Q4398828
cites work: Q4739657
cites work: On Context-Free Languages
cites work: Q5678435
description: scientific article; zbMATH DE number 2082300