On the Number of 2-Protected Nodes in Tries and Suffix Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

On the Number of 2-Protected Nodes in Tries and Suffix Trees

Abstract

We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases. For instance, in a uniform trie with $n$ leaves, the number of 2-protected nodes is approximately 0.803$n$, plus small first-order fluctuations. The 2-protected nodes are an emerging way to distinguish the interior of a tree from the fringe.
Fichier principal
Vignette du fichier
dmAQ0130.pdf (332.71 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01197232 , version 1 (11-09-2015)

Identifiers

Cite

Jeffrey Gaither, Yushi Homma, Mark Sellke, Mark Daniel Ward. On the Number of 2-Protected Nodes in Tries and Suffix Trees. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.381-398, ⟨10.46298/dmtcs.3008⟩. ⟨hal-01197232⟩

Collections

INSMI TDS-MACS
307 View
549 Download

Altmetric

Share

Gmail Facebook X LinkedIn More