Tight upper and lower bounds on suffix tree breadth

DOI10.1016/j.tcs.2020.11.037zbMath1477.68075OpenAlexW3004228629MaRDI QIDQ2220861

Bella Zhukova, Golnaz Badkobeh, Simon J. Puglisi, Juha Kärkkäinen, Paweł Gawrychowski

Publication date: 25 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://research.gold.ac.uk/id/eprint/28732/1/main.pdf

zbMATH Keywords

combinatoricsstringsuffix arraysuffix treelongest common prefix

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Tighter bounds for the sum of irreducible LCP values
• Permuted Longest-Common-Prefix Array
• String Inference from Longest-Common-Prefix Array
• On Suffix Tree Breadth
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Tight upper and lower bounds on suffix tree breadth