On the Number of 2-Protected Nodes in Tries and Suffix Trees
نویسندگان
چکیده
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.803n, plus small first-order fluctuations. The 2-protected nodes are an emerging way to distinguish the interior of a tree from the fringe.
منابع مشابه
Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth
Suffix trees are the most frequently used data structures in algorithms on words. In this paper, we consider the depth of a compact suffix tree, also known as the PAT tree, under some simple probabilistic assumptions. For a biased memoryless source, we prove that the limiting distribution for the depth in a PAT tree is the same as the limiting distribution for the depth in a PATRICIA trie, even...
متن کاملAverage profiles, from tries to suffix-trees
We build upon previous work of Fayolle (2004) and Park and Szpankowski (2005) to study asymptotically the average internal profile of tries and of suffix-trees. The binary keys and the strings are built from a Bernoulli source (p, q). We consider the average number pk,P(ν) of internal nodes at depth k of a trie whose number of input keys follows a Poisson law of parameter ν. The Mellin transfor...
متن کاملLinear-size suffix tries
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = |w|, a suffix tree for w takes O(n) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each...
متن کاملThe Average Profile of Suffix Trees
The internal profile of a tree structure denotes the number of internal nodes found at a specific level of the tree. Similarly, the external profile denotes the number of leaves on a level. The profile is of great interest because of its intimate connection to many other parameters of trees. For instance, the depth, fill-up level, height, path length, shortest path, and size of trees can each b...
متن کاملOn 2-protected nodes in random digital trees
In this paper, we consider the number of 2-protected nodes in random digital trees. For tries, Gaither, Homma, Sellke and Ward (2012) and Gaither and Ward (2013) derived asymptotic expansions for mean and variance. We re-derive their results (with some corrections) and show their conjectured central limit theorem. This will be done by recent unified approaches by Fuchs, Hwang and Zacharovas (20...
متن کامل