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..
--
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.comwrote:
I have studied about it ,but could not understand why their construction
is in linear time and support so many
