We present, in this paper, two efficient algorithms for linear time suffix array construction. These two algorithms achieve their linear time complexities, using the techniques of divide-and-conquer,â€¦ (More)

We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm.The SA-IS algorithm is novel because of the LMS-substrings used for the problem reduction andâ€¦ (More)

This article presents an <i>O</i>(<i>n</i>)-time algorithm called SACA-K for sorting the suffixes of an input string <i>T</i>[0, <i>n</i>-1] over an alphabet <i>A</i>[0, <i>K</i>-1]. The problem ofâ€¦ (More)

Let S be an n-character string terminated with an unique smallest sentinel, its suffix array SA(S) is an array of pointers for all the suffixes in S sorted in the lexicographically ascending order.â€¦ (More)

As an important variant of the Burrows-Wheeler Transform (BWT), the Sort Transform (ST) can speed up the transformation by sorting only a portion of the matrix. However, because the currently knownâ€¦ (More)

We present a new suffix array construction algorithm that aims to build, in external memory, the suffix array for an input string of length n measured in the magnitude of tens of Giga characters overâ€¦ (More)

ATM switches have been proposed as the switching fabric cores of many high-performance IP switches. In this paper, we present an efficient algorithm called IPPIM for scheduling variable-length IPâ€¦ (More)

An analytical model for the performance analysis of a multiple input queued asynchronous transfer mode (ATM) switch is presented in this paper. The interconnection network of the ATM switch isâ€¦ (More)