Subject: Re: [boost] Project Idea for 2014 GSoC
From: Prabhat Kumar (dawnavd_at_[hidden])
Date: 2014-02-21 05:54:38
>
> 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