Jul 4, 2012 · We consider the problem of constructing a sparse suffix tree (or suffix array) for b suffixes of a given text T of size n, using only O(b) words ...

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 ...

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 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 Construction in Small Space. Page 2. The sparse suffix array (SSA). T bn aa. T a s n n. Page 3. The sparse suffix array (SSA). T bn aa. T a s.

Jul 4, 2012 · The goal is to construct the suffix tree for only those b indices, while using little space during the construction process, which will ...

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 ...

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 ...

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 ...

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 ...