Tight upper and lower bounds on suffix tree breadth

被引：0

作者：

Badkobeh, Golnaz ^{[1
]}

Gawrychowski, Pawel ^{[2
]}

Kaerkkaeinen, Juha ^{[3
]}

Puglisi, Simon J. ^{[3
]}

Zhukova, Bella ^{[3
]}

机构：

[1] Goldsmiths Univ London, Dept Informat, London, England

[2] Univ Wroclaw, Wroclaw, Poland

[3] Univ Helsinki, Dept Comp Sci, Helsinki Inst Informat Technol, Helsinki, Finland

来源：

THEORETICAL COMPUTER SCIENCE | 2021年 / 854卷 / 854期

关键词：

String; Suffix tree; Suffix array; Longest common prefix; Combinatorics;

D O I：

10.1016/j.tcs.2020.11.037

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The suffix tree - the compacted trie of all the suffixes of a string - is the most important and widely-used data structure in string processing. We consider a natural combinatorial question about suffix trees: for a string S of length n, how many nodes nu(S)(d) can there be at (string) depth d in its suffix tree? We prove nu(n, d) = max(S) (is an element of Sigma n) nu(S)(d) is O ((n/d) log(n/d)), and show that this bound is asymptotically tight, describing strings for which nu(S)(d) is Omega((n/d)log(n/d)). (C) 2020 Elsevier B.V. All rights reserved.

引用

页码：63 / 67

页数：5

共 50 条

[1] On Suffix Tree Breadth
Badkobeh, Golnaz
Karkkainen, Juha
Puglisi, Simon J.
Zhukova, Bella
[J]. STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2017), 2017, 10508 : 68 - 73
[2] The tree model for hashing: Lower and upper bounds
Gil, J
Heide, FMAD
Wigderson, A
[J]. SIAM JOURNAL ON COMPUTING, 1996, 25 (05) : 936 - 955
[3] Tight upper and lower bounds for the reciprocal sum of Proth primes
Bertalan Borsos
Attila Kovács
Norbert Tihanyi
[J]. The Ramanujan Journal, 2022, 59 : 181 - 198
[4] Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes
Hashemi, Yoones
Banihashemi, Amir H.
[J]. IEEE COMMUNICATIONS LETTERS, 2018, 22 (01) : 33 - 36
[5] Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Christoph Berkholz
Paul Bonsma
Martin Grohe
[J]. Theory of Computing Systems, 2017, 60 : 581 - 614
[6] Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Berkholz, Christoph
Bonsma, Paul
Grohe, Martin
[J]. ALGORITHMS - ESA 2013, 2013, 8125 : 145 - 156
[7] Tight upper and lower bounds for the reciprocal sum of Proth primes
Borsos, Bertalan
Kovacs, Attila
Tihanyi, Norbert
[J]. RAMANUJAN JOURNAL, 2022, 59 (01): : 181 - 198
[8] TIGHT UPPER AND LOWER BOUNDS ON PERTURBATION COEFFICIENTS FOR ANHARMONIC OSCILLATORS
BENDER, CM
LING, KM
[J]. PHYSICAL REVIEW D, 1979, 19 (12): : 3808 - 3810
[9] Arbitrarily tight upper and lower bounds on the Bayesian probability of error
AviItzhak, H
Diep, T
[J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1996, 18 (01) : 89 - 91
[10] Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Berkholz, Christoph
Bonsma, Paul
Grohe, Martin
[J]. THEORY OF COMPUTING SYSTEMS, 2017, 60 (04) : 581 - 614

← 1 2 3 4 5 →