Apr 30, 2009 · In this paper we propose a randomized linear-time algorithm for constructing 2-D suffix trees on-line. This algorithm is superior to previous ...

We consider constructing 2-D suffix trees on-line, which means, instead of giving the whole matrix A in advance, A is separated and each part of A is given at ...

We consider constructing 2-D suffix trees on-line, which means, instead of giving the whole matrix A in advance, A is separated and each part of A is given at ...

We consider constructing 2-D suffix trees on-line, which means, instead of giving the whole matrix A in advance, A is separated and each part of A is given at ...

We present a new technique, which we refer to as implicit updates, based on which we obtain: (a) an algorithm for the on-line construction of the Lsuffix ...

We present a new technique, which we refer to as implicit updates, based on which we obtain: (a) an algorithm for the on-line construction of the Lsuffix ...

Dive into the research topics of 'Improving on-line construction of two-dimensional suffix trees for square matrices'. Together they form a unique fingerprint.

We say that a data structure is built on-line if, at any instant, we have the data structure corresponding to the input we have seen up to that instant.

Bibliographic details on Improving on-line construction of two-dimensional suffix trees for square matrices.

An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string, developed as a linear-time ...