
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
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 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
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment