
Be the first to like this
Published on
This paper presents, an space efficient algorithm for linear time suffix array construction. The algorithm uses the techniques of divideandconquer, and recursion. What differentiates the proposed …
This paper presents, an space efficient algorithm for linear time suffix array construction. The algorithm uses the techniques of divideandconquer, and recursion. What differentiates the proposed algorithm from the variablelength leftmost Stype (LMS) substrings is the efficient usage of the memory to construct the suffix array. The modified induced sorting algorithm for the variablelength LMS substrings uses efficient usage of the memory space than the existing variable length left most Stype(LMS) substrings algorithm
Be the first to like this
Be the first to comment