Results 1  10
of
91
Cénac, Chauvin, Paccaut, Pouyanne: uncommon suffix tries Uncommon Suffix Tries
, 2013
"... Common assumptions on the source producing the words inserted in a suffix trie with n leaves lead to a lnn height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of n and another one whose saturation level is negligible with respect to lnn. Bot ..."
Abstract
 Add to MetaCart
Common assumptions on the source producing the words inserted in a suffix trie with n leaves lead to a lnn height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of n and another one whose saturation level is negligible with respect to lnn
The Use of Suffix Tries to Detect Randomly Created Datasets
"... In the past suffix tries have been proven to be a useful tool for string matching applications. There are several instances where a lengthy stream of data is given with no visually apparent recurrences of sequences. The ability to notice these recurring sequences can be very important when involving ..."
Abstract
 Add to MetaCart
In the past suffix tries have been proven to be a useful tool for string matching applications. There are several instances where a lengthy stream of data is given with no visually apparent recurrences of sequences. The ability to notice these recurring sequences can be very important when
OnLine Construction of Suffix Trees
, 1995
"... An online algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part of the strin ..."
Abstract

Cited by 437 (2 self)
 Add to MetaCart
of the string ready. The method is developed as a lineartime version of a very simple algorithm for (quadratic size) suffix tries. Regardless of its quadratic worstcase this latter algorithm can be a good practical method when the string is not too long. Another variation of this method is shown to give in a
o g o
"... • Online construction of suffix tries in quadratic time • Suffix trees • Online construction of suffix trees in linear time ..."
Abstract
 Add to MetaCart
• Online construction of suffix tries in quadratic time • Suffix trees • Online construction of suffix trees in linear time
Average profiles, from tries to suffixtrees
 in 2005 International Conference on Analysis of Algorithms, C. Martínez (ed.), Discrete Mathematics and Theoretical Computer Science, Proceedings AD
, 2005
"... internal profile of tries and of suffixtrees. 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 transform of the correspo ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
internal profile of tries and of suffixtrees. 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 transform
On the Number of . . . and Suffix Trees
, 2012
"... We use probabilistic and combinatorial tools on strings to discover the average number of 2protected nodes in tries and in suffix trees. Our analysis covers both the uniform and nonuniform cases. For instance, in a uniform trie with n leaves, the number of 2protected nodes is approximately 0.803n ..."
Abstract
 Add to MetaCart
We use probabilistic and combinatorial tools on strings to discover the average number of 2protected nodes in tries and in suffix trees. Our analysis covers both the uniform and nonuniform cases. For instance, in a uniform trie with n leaves, the number of 2protected nodes is approximately 0
The average profile of suffix trees
 In The Fourth Workshop on Analytic Algorithmics and Combinatorics
, 2007
"... 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 ins ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. For instance, the depth, fillup level, height, path length, shortest path, and size of trees can each be interpreted in terms of the profile. The current study is motivated by the work of Park et al. [22], which was a comprehensive study of the profile of tries constructed from independent strings (also, each
Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth
"... Abstract. 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 ..."
Abstract
 Add to MetaCart
Abstract. 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
Compact Suffix Trees Resemble Patricia Tries: Limiting Distribution Of Depth
 Journal of the Iranian Statistical Society
, 1993
"... Sux trees are the most frequently used data structure in algorithms on words. Despite this, little is known about their behavior in a probabilistic framework. In this paper, we consider the depth of a compact sux tree, also known as the PAT tree, under some simple probabilistic assumptions. In fact, ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Sux trees are the most frequently used data structure in algorithms on words. Despite this, little is known about their behavior in a probabilistic framework. In this paper, we consider the depth of a compact sux tree, also known as the PAT tree, under some simple probabilistic assumptions. In fact, for the case of an asymmetric alphabet, 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 though the PATRICIA trie is constructed over statistically independent strings. In other words, the limiting distribution for the depth in a PAT tree storing n suxes is normal. This research was primary supported by NATO Collaborative Grant 0057/89. y This research was in part supported by AFOSR grant 900107 and by NSF grant CCR8900305. z This author's research was supported in part by NATO Collaborative grant 00570/89, and in part by AFOSR grant 900107, by NSF grants CCR9201078 and NCR9206315...
Phonetic Realization of Suffix vs. Nonsuffix Morphemes in Taiwanese
"... We investigated how Taiwanese diminutive suffixa is phonetically realized in both juncture and context positions. As a grammatical morpheme, suffixa is similar to Mandarin diminutive suffixzi as in yizi “chair”. While Mandarin suffixzi always has a neutral tone or belongs to an unstressed sylla ..."
Abstract
 Add to MetaCart
of the same tone tsa “early ” in both juncture position and in the middle position of trisyllabic words. Different speaking rates were also manipulated, since we expect to see some reductions of the weak element in faster speech rate. Our results show that Taiwanese diminutive suffixa behaves exactly like
Results 1  10
of
91