I also have done suffix array
its simple and fast
Arun,
On Wed, Aug 19, 2009 at 1:37 AM, Miroslav Balaz wrote:
> What you mean by unicode supprot?
> I think only problem is that characters that look the same may have
> different encodings.
> So it is enough in each compare to use the function tha
Thank you for replying.
Here "Unicode support" refers to allowing non-ascii characters as
input string, which may be Chinese or Japanese.
It is known that by utf-8 encoding a Chinese character is represented
with 3 bytes, for example, 0xe8b685. Then there raises a problem, if a
utf-8 encoded Chi
What you mean by unicode supprot?
I think only problem is that characters that look the same may have
different encodings.
So it is enough in each compare to use the function that resolves above
problem.
I made 3 suffix tree implementations and it is easy to change string type in
that.
But my impl
