Structural properties of the string statistics problem
type: Item
instance of: scholarly article
title: Structural properties of the string statistics problem
zbMATH Open document ID: 0593.68047
DOI: 10.1016/0022-0000(85)90060-1
published in: Journal of Computer and System Sciences
publication date: 1985-01-01T00:00:00Z
full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3954285
zbMATH Keywords: pattern matching
zbMATH Keywords: weighted index tree
author: Alberto Apostolico
author: F. P. Preparata
MaRDI profile type: Publication
OpenAlex ID: W2069719635
cites work: Q3332275
cites work: Q4091421
cites work: The Boyer–Moore–Galil String Searching Strategies Revisited
cites work: Q3690245
cites work: Optimal off-line detection of repetitions in a string
cites work: A fast string searching algorithm
cites work: Q3673134
cites work: An optimal algorithm for computing the repetitions in a word
cites work: Q4181952
cites work: Fast Pattern Matching in Strings
cites work: Q5625457
cites work: Q3659988
cites work: The equation \(a_ M=b^ Nc^ P\) in a free group
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: Efficient On-Line Construction and Correction of Position Trees
description: scientific article; zbMATH DE number 3954285