Results 161 to 170 of about 40,875 (196)
Some of the next articles are maybe not open access.
REACHABILITY ON SUFFIX TREE GRAPHS
International Journal of Foundations of Computer Science, 2008We analyze the complexity of graph reachability queries on ST-graphs, defined as directed acyclic graphs (DAGs) obtained by merging the suffix tree of a given string and its suffix links. Using a simplified reachability labeling algorithm presented by Agrawal et al. (1989), we show that for a random string of length n, its ST-graph can be preprocessed
Yasuto Higa +3 more
openaire +3 more sources
A Note on the Height of Suffix Trees
SIAM Journal on Computing, 1992Summary: Consider a random word in which the individual symbols are drawn from a finite or infinite alphabet with symbol probabilities \(p_ i\), and let \(H_ n\) be the height of the suffix tree constructed from the first \(n\) suffixes of this word.
Devroye, Luc +2 more
openaire +2 more sources
1996
A sparse suffix tree is a suffix tree that represents only a subset of the suffixes of the text. This is in contrast to the standard suffix tree that represents all suffixes. By selecting a small enough subset, a sparse suffix tree can be made to fit the available storage, unfortunately at the cost of increased search times.
Juha Kärkkäinen, Esko Ukkonen
openaire +1 more source
A sparse suffix tree is a suffix tree that represents only a subset of the suffixes of the text. This is in contrast to the standard suffix tree that represents all suffixes. By selecting a small enough subset, a sparse suffix tree can be made to fit the available storage, unfortunately at the cost of increased search times.
Juha Kärkkäinen, Esko Ukkonen
openaire +1 more source
Journal of Algorithms, 1998
Summary: We give first the representation of a suffix tree that uses \(n\lg n+ O(n)\) bits of space and supports searching for a pattern string in the given text (from a fixed size alphabet) in \(O(m)\) time, where \(n\) is the size of the text and \(m\) is the length of the pattern.
J. Ian Munro +2 more
openaire +1 more source
Summary: We give first the representation of a suffix tree that uses \(n\lg n+ O(n)\) bits of space and supports searching for a pattern string in the given text (from a fixed size alphabet) in \(O(m)\) time, where \(n\) is the size of the text and \(m\) is the length of the pattern.
J. Ian Munro +2 more
openaire +1 more source
Data Compression Conference (DCC'06), 2006
A close inspection of Fiala and Green's implementation of Ziv-Lempel'77 dictionary compression method reveals a surprising inefficiency. The match they are searching for from the root down the suffix tree can be obtained for free from the suffix tree construction algorithm!
openaire +1 more source
A close inspection of Fiala and Green's implementation of Ziv-Lempel'77 dictionary compression method reveals a surprising inefficiency. The match they are searching for from the root down the suffix tree can be obtained for free from the suffix tree construction algorithm!
openaire +1 more source
Online suffix trees with counts
Data Compression Conference, 2004. Proceedings. DCC 2004, 2004This paper extend Ukkonen's online suffix tree construction algorithm to support substring frequency queries, by adding count fields to the internal nodes of the tree. This has applications in the field of sequential data compression. One major problem is that Ukkonen's online construction algorithm does not maintain explicit end of string markers in ...
Ó Nualláin, B.S., de Rooij, S.
openaire +2 more sources
Random Structures & Algorithms, 2003
AbstractA random suffix search tree is a binary search tree constructed for the suffixes Xi = 0 · BiBi+1Bi+2… of a sequence B1, B2, B3, … of independent identically distributed random b‐ary digits Bj. Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on ℤb.
Devroye, Luc, Neininger, Ralph
openaire +1 more source
AbstractA random suffix search tree is a binary search tree constructed for the suffixes Xi = 0 · BiBi+1Bi+2… of a sequence B1, B2, B3, … of independent identically distributed random b‐ary digits Bj. Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on ℤb.
Devroye, Luc, Neininger, Ralph
openaire +1 more source
Efficient implementation of suffix trees
Software: Practice and Experience, 1995AbstractWe study the problem of string searching using the traditional approach of storing all unique substrings of the text in a suffix tree. The methods of path compression, level compression and data compression are combined to build a simple, compact and efficient implementation of a suffix tree.
Arne Andersson, Stefan Nilsson
openaire +1 more source
Suffix cactus: A cross between suffix tree and suffix array
1995The suffix cactus is a new alternative to the suffix tree and the suffix array as an index of large static texts. Its size and its performance in searches lies between those of the suffix tree and the suffix array. Structurally, the suffix cactus can be seen either as a compact variation of the suffix tree or as an augmented suffix array.
openaire +1 more source
On-line construction of suffix trees
Algorithmica, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source