Space Efficient Suffix Array Construction using Induced Sorting LMS Substrings
Rajesh Yelchuri, Nagamalleswara Rao.N · International Journal of Information Sciences and Techniques · 2013
This paper presents, an space efficient algorithm for linear time suffix array construction. The algorithm uses the techniques of divide-and-conquer, and recursion. What differentiates the proposed algorithm from the variable-length leftmost S-type (LMS) substrings is the efficient usage of the memory to construct the suffix array. The modified induced sorting algorithm for the variable-length LMS substrings uses efficient usage of the memory space than the existing variable length left most S-type(LMS) substrings algorithm KEYWORDSDivide and Conquer, Suffix Array.