On suffix tree breadth

DOI10.1007/978-3-319-67428-5_6MaRDI QIDQ5150919zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Tight upper and lower bounds on suffix tree breadth
• An estimation of the size of non-compact suffix trees
• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
• scientific article; zbMATH DE number 177551
• Compact suffix trees resemble PATRICIA tries: limiting distribution of the depth

Cites work

• Permuted Longest-Common-Prefix Array
• String inference from longest-common-prefix array
• Tighter bounds for the sum of irreducible LCP values

Cited in

(2)

• Tight upper and lower bounds on suffix tree breadth
• scientific article; zbMATH DE number 742990 (Why is no real title available?)

This page was built for publication: On suffix tree breadth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150919)