String matching bounds via coding
type: Item
instance of: scholarly article
title: String matching bounds via coding
zbMATH Open document ID: 0873.60029
author: Paul Shields
published in: The Annals of Probability
publication date: 1997-06-09T00:00:00Z
Mathematics Subject Classification ID: 60G17
Mathematics Subject Classification ID: 94A24
zbMATH DE Number: 1018392
zbMATH Keywords: string matching
zbMATH Keywords: prefix codes
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aop/1024404290
OpenAlex ID: W2000784587
cites work: The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
cites work: How sampling reveals a process
cites work: Entropy and data compression schemes
cites work: An Entropy Estimator for a Class of Infinite Alphabet Processes
cites work: Q3199318
cites work: Entropy and prefixes
cites work: String matching: The ergodic case
cites work: Q4888784
DOI: 10.1214/AOP/1024404290
description: scientific article; zbMATH DE number 1018392