Two Efficient Algorithms for Linear Time Suffix Array Construction

[摘要]：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, and recursion. What distinguish the proposed algorithms

[全文传递流程]：

一般上传文献全文的时限在1个工作日内