Check out Ukkonen's algorithm. You can build a suffix tree in O(n). Good stuff. I would start there
On Tue, Nov 8, 2011 at 10:41 PM, kumar raja <rajkumar.cs...@gmail.com>wrote: > I have studied about it ,but could not understand why their construction > is in linear time and support so many operations with less time complexity. > i am quite confused. suggest me some good resource to learn about them with > proper proof of time complexity for each and every operation.. > > -- > Regards > Kumar Raja > M.Tech(SIT) > IIT Kharagpur, > 10it60...@iitkgp.ac.in > > > -- > 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?hl=en. > -- 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?hl=en.