Results 1  10
of
151,751
Weighted ancestors in suffix trees
 In Proc. 22nd ESA
, 2014
"... Abstract. The classical, ubiquitous, predecessor problem is to construct a data structure for a set of integers that supports fast predecessor queries. Its generalization to weighted trees, a.k.a. the weighted ancestor problem, has been extensively explored and successfully reduced to the predecess ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. The classical, ubiquitous, predecessor problem is to construct a data structure for a set of integers that supports fast predecessor queries. Its generalization to weighted trees, a.k.a. the weighted ancestor problem, has been extensively explored and successfully reduced
Overcoming the Memory Bottleneck in Suffix Tree Construction
"... The suffix tree of a string is the fundamental data structure of string processing. Recent focus on massive data sets has sparked interest in overcoming the memory bottlenecks of known algorithms for building suffix trees. Our main contribution is a new algorithm for suffix tree construction in whic ..."
Abstract

Cited by 34 (2 self)
 Add to MetaCart
The suffix tree of a string is the fundamental data structure of string processing. Recent focus on massive data sets has sparked interest in overcoming the memory bottlenecks of known algorithms for building suffix trees. Our main contribution is a new algorithm for suffix tree construction
Faster Suffix Tree Construction with Missing Suffix Links
 In Proceedings of the Thirty Second Annual Symposium on the Theory of Computing
, 2000
"... We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for 2D arrays. These trees also have the property that the node degrees may be large. We add a new backpropagation component to ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
to McCreight's algorithm and also give a high probability perfect hashing scheme to cope with large degrees. We show that these two features enable construction of suffix trees for general situations with missing suffix links in O(n) time, with high probability. This gives the first randomized
BustBundled Suffix Trees
, 2006
"... We introduce a data structure, the Bundled Suffix Tree (BuST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a nontransitive relation ≈ among its letters. Following the path of a substring β within a BuST, constructed over a text α of length m, ..."
Abstract
 Add to MetaCart
We introduce a data structure, the Bundled Suffix Tree (BuST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a nontransitive relation ≈ among its letters. Following the path of a substring β within a BuST, constructed over a text α of length m
The Suffix Binary Search Tree and Suffix AVL Tree
 Journal of Discrete Algorithms
, 2000
"... Suffix trees and suffix arrays are classical data structures that are used to represent the set of suffixes of a given string, and thereby facilitate the efficient solution of various string processing problems  in particular online string searching. Here we investigate the potential of suitably ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
in some circumstances  for instance in cases where only a subset of the suffixes need be represented. Construction of a suffix BST can be achieved in O(L) time, where L is the path length of the tree, and in the case of a suffix AVLtree this is O(n log n), where n is the length of the input string
A Suffix Tree Or Not A Suffix Tree?
"... In this paper we study the structure of suffix trees. Given an unlabeled tree τ on n nodes and suffix links of its internal nodes, we ask the question ”Is τ a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as τ? We place no restrictions on S, in particu ..."
Abstract
 Add to MetaCart
if τ is a suffix tree is not an easy task, because, with no restrictions on the final symbol, we cannot guess the length of a string that realizes τ from the number of leaves. And without an upper bound on the length of such a string, it is not even clear how to solve the problem by an exhaustive
Abstract Distributed Suffix Trees ⋆
"... We present a new variant of the suffix tree called a distributed suffix tree (DST) which allows for much larger databases of strings to be handled efficiently. The method is based on a new linear time construction algorithm for subtrees of a suffix tree. The new data structure tackles the memory bot ..."
Abstract
 Add to MetaCart
We present a new variant of the suffix tree called a distributed suffix tree (DST) which allows for much larger databases of strings to be handled efficiently. The method is based on a new linear time construction algorithm for subtrees of a suffix tree. The new data structure tackles the memory
TITLE: Suffix Trees for Document Retrieval
, 2012
"... iii Suffix Trees for Document Retrieval by ..."
Attack Of The Mutant Suffix Trees
, 1998
"... This is a thesis for the degree of filosofie licentiat (a Swedish degree between Master of Science and Ph.D.). It comprises three articles, all treating variations and augmentations of suffix trees, and the capability of the suffix tree data structure to efficiently capture similarities between diff ..."
Abstract
 Add to MetaCart
, as well as in ZivLempel compression. The second article presents a generalized suffix tree which is able to index a select subset of the suffixes of a string, with a construction algorithm which is optimal in time and space. The final article deals with the connection between the explicit context trees
Results 1  10
of
151,751