Results 181 to 190 of about 1,070,371 (211)

Compressed by the Suffix Tree

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   +2 more sources

Online suffix trees with counts

Data Compression Conference, 2004. Proceedings. DCC 2004, 2004
This 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

Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays

Algorithmica, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong Kyue Kim, Minhwan Kim, Heejin Park
openaire   +3 more sources

Computing suffix links for suffix trees and arrays

Information Processing Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Suffix Trees as Language Models

Proceedings of the Language Resources and Evaluation Conference, 2012
Suffix trees are data structures that can be used to index a corpus. In this paper, we explore how some properties of suffix trees naturally provide the functionality of an n-gram language model with variable n. We explain these properties of suffix trees, which we leverage for our Suffix Tree Language Model (STLM) implementation and explain how a ...
Redd Kennington, Casey, Kay, Martin, Friedrich, Annemarie   +2 more
openaire   +3 more sources

Random suffix search trees

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

Efficient implementation of suffix trees

Software: Practice and Experience, 1995
AbstractWe 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

1995
The 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   +2 more sources

Suffix trees and string complexity

2007
Let s = (s1, s2, ..., sn) be a sequence of characters where si Ɛ Zp for 1 ≤ i ≤ n. One measure of the complexity of the sequence s is the length of the shortest feedback shift register that will generate s, which is known as the maximum order complexity of s [17, 18].
Luke O'Connor, Tim Snider
openaire   +1 more source

On-line construction of suffix trees

Algorithmica, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source