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 implementations was not good, it was slow, however in O(n). Suffix array was faster. 2009/8/18 Fred <[email protected]> > > Does anybody know, by chance, a suffix tree implementation with > Unicode support? > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
