Tight Upper and Lower Bounds on Suffix Tree Breadth
- Submitting institution
-
Goldsmiths' College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 3452
- Type
- D - Journal article
- DOI
-
10.1016/j.tcs.2020.11.037
- Title of journal
- Theoretical Computer Science
- Article number
- -
- First page
- 1
- Volume
- 0
- Issue
- -
- ISSN
- 0304-3975
- Open access status
- Compliant
- Month of publication
- November
- Year of publication
- 2020
- URL
-
http://research.gold.ac.uk/id/eprint/28732/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- 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. The paper consideres a natural combinatorial question about suffix trees: for a string S of length n, how many nodes νS(d) can there be at (string) depth d in its suffix tree? the Authors prove ν(n, d) = maxS∈Σn νS (d) is O((n/d) log(n/d)), and show that this bound is asymptotically tight, describing strings for which νS(d) is Ω((n/d)log(n/d)).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -