On Suffix Tree Breadth

DOI10.1007/978-3-319-67428-5_6zbMath1454.68026OpenAlexW2751653493MaRDI QIDQ5150919

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

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://research.gold.ac.uk/21677/1/suffix-tree-breadth.pdf

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

Tight upper and lower bounds on suffix tree breadth

Cites Work

• Tighter bounds for the sum of irreducible LCP values
• Permuted Longest-Common-Prefix Array
• String Inference from Longest-Common-Prefix Array

This page was built for publication: On Suffix Tree Breadth