21 Feb
2014
21 Feb
'14
10:54 a.m.
Hi, actually suffix array can be computed in O(n) time.
The paper describing this algorithm:
http://www.cs.cmu.edu/~guyb/realworld/papersS04/KaSa03.pdf
the paper includes some implementation as well.
Of course it might be the case that O(n log n) implementation is faster for practical cases.
Hello, Yeah for practical cases O(n log n) is fast but its good to know that O(n) algo also exits for the construction of suffix array I have gone through this paper. And good thing is I can implement this :). However, I wanted to know is this good idea to include Suffix array in boost and to take it as project in GSoC Regards, Prabhat Kumar