Add to ORKGAbstract. 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 though the PATRICIA trie is constructed from statistically independent strings. As a result, we show that the limiting distribution for the depth in a PAT tree built over n suffixes is normal.
The suffix tree — the compacted trie of all the suffixes of a string — is the most important and wid...
A suffix tree is a data structure used for storing, sending, and analyzing words. Suffix trees are p...
The suffix tree—the compacted trie of all the suffixes of a string—is the most important and widely-...
Projet ICSLASuffix trees are the most frequently used data structure in algorithms on words. Despite...
A word is a string of symbols, finite or infinite in length, from a finite alphabet. Many algorithms...
This paper studies in a probabilistic framework some topics concerning the way words (strings) can o...
In this report, we prove that under a Markovian model of order one, the average depth of suffix tree...
AbstractWe study in a probabilistic framework some topics concerning the way words can overlap. Our ...
We study in a probabilistic framework some topics concerning the way words can overlap. Our probabil...
This paper establishes the limiting distribution for the depth of keys in a PATRICIA trie. A PATRICI...
Programme 2 : Calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Docume...
A suffix tree is a data structure used mainly for pattern matching. It is known that the space compl...
International audienceSuffix trees are highly regarded data structures for text indexing and string ...
A random suffix search tree is a binary search tree constructed for the suffixes X i = 0:B i B i+1 B...
AbstractSuffix trees, directed acyclic word graphs (DAWGs) and related data structures are useful fo...
The suffix tree — the compacted trie of all the suffixes of a string — is the most important and wid...
A suffix tree is a data structure used for storing, sending, and analyzing words. Suffix trees are p...
The suffix tree—the compacted trie of all the suffixes of a string—is the most important and widely-...
Projet ICSLASuffix trees are the most frequently used data structure in algorithms on words. Despite...
A word is a string of symbols, finite or infinite in length, from a finite alphabet. Many algorithms...
This paper studies in a probabilistic framework some topics concerning the way words (strings) can o...
In this report, we prove that under a Markovian model of order one, the average depth of suffix tree...
AbstractWe study in a probabilistic framework some topics concerning the way words can overlap. Our ...
We study in a probabilistic framework some topics concerning the way words can overlap. Our probabil...
This paper establishes the limiting distribution for the depth of keys in a PATRICIA trie. A PATRICI...
Programme 2 : Calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Docume...
A suffix tree is a data structure used mainly for pattern matching. It is known that the space compl...
International audienceSuffix trees are highly regarded data structures for text indexing and string ...
A random suffix search tree is a binary search tree constructed for the suffixes X i = 0:B i B i+1 B...
AbstractSuffix trees, directed acyclic word graphs (DAWGs) and related data structures are useful fo...
The suffix tree — the compacted trie of all the suffixes of a string — is the most important and wid...
A suffix tree is a data structure used for storing, sending, and analyzing words. Suffix trees are p...
The suffix tree—the compacted trie of all the suffixes of a string—is the most important and widely-...