Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
type: Item
instance of: scholarly article
title: Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
zbMATH Open document ID: 0802.68097
DOI: 10.1016/0097-3165(94)90065-5
author: Philippe Jacquet
author: Wojciech Szpankowski
published in: Journal of Combinatorial Theory. Series A
publication date: 1994-11-30T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 599875
zbMATH Keywords: Bernoulli model
zbMATH Keywords: suffix tree
zbMATH Keywords: digital tree
zbMATH Keywords: data compression
MaRDI profile type: Publication
full work available at URL: 0097-3165(94)90065-5
OpenAlex ID: W1603682988
cites work: Q4091421
cites work: Self-alignments in words and their applications
cites work: Average sizes of suffix trees and DAWGs
cites work: Q3682518
cites work: A note on the average depth of trees
cites work: A Note on the Height of Suffix Trees
cites work: On the performance evaluation of extendible hashing and trie searching
cites work: Q3704890
cites work: Maximal Prefix-Synchronized Codes
cites work: Periods in strings
cites work: String overlaps, pattern matching, and nontransitive games
cites work: Q4037422
cites work: Q4057549
cites work: Q4529547
cites work: On the Complexity of Finite Sequences
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Asymptotical growth of a class of random trees
cites work: Paths in a random digital tree: limiting distributions
cites work: Limiting Distribution for the Depth in PATRICIA Tries
cites work: New results on the size of tries
cites work: Entropy and prefixes
cites work: Some results on V-ary asymmetric tries
cites work: The evaluation of an alternative sum with applications to the analysis of some data structures
cites work: On the height of digital trees and related problems
cites work: A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
cites work: A universal algorithm for sequential data compression
description: scientific article; zbMATH DE number 599875