I also have done suffix array its simple and fast Arun, On Wed, Aug 19, 2009 at 1:37 AM, Miroslav Balaz <gpsla...@googlemail.com>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 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 <hn.ft.p...@gmail.com> > > >> Does anybody know, by chance, a suffix tree implementation with >> Unicode support? >> >> > > > > -- Potential is not what U have, its what U think U have!!! It is better to worn out than rust. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
