Jun 4, 2005 · 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 ...
May 8, 2021 · In this paper we propose a deterministic algorithm that constructs for a given readonly string of length n over the alphabet \{0,1,\ldots,n^{\mathcal{O}(1)}\}
People also ask
What is a suffix tree in information retrieval?
What is suffix tree in biology?
What is the difference between suffix tree and array?
What is the other name for suffix tree?
We are the first to break the naive O(nb) time algorithm for general sparse suffix trees, by showing how to construct a sparse suffix tree in O(n log2 b) time,.
In this paper we study two closely related small-space indexing data structures: a sparse suffix tree and a longest common extension (LCE) index. We investigate ...
Such a tree is defined by partitioning the text into blocks of equal size and constructing the suffix tree only for those suffixes that start at block ...
Aug 2, 2016 · In some applications, we work with a subset of b interesting suffixes, which are stored in the so-called sparse suffix tree. Because the size of ...
In this section we give a deterministic algorithm which verifies the correctness of the sparse suffix and LCP arrays constructed in Theorem 2. This immediately.
Sparse Suffix Tree: • Compacted trie representing all designated suffixes. • For each node, child edges are sorted. • Since edge labels can be encoded by ...
A suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compression algorithms,
We consider the problem of constructing a sparse suffix tree (or suffix array) for b suffixes of a given text T of length n, using only O(b) words of space ...