I don't understand how to constuct the suffix tree in less than O(n^2) can anyone explain me this?
On Tue, Jul 6, 2010 at 10:03 AM, Jitendra Kushwaha <[email protected] > wrote: > @Ankit Narang > Think about your algo it is not a O(n). First of all you wont get > solution comparing start of str1 and end of str2 > > Their is solution in O(n) other than suffix tree > Here is the link > > http://www.akalin.cx/2007/11/28/finding-the-longest-palindromic-substring-in-linear-time/ > > -- > Regards > Jitendra Kushwaha > MNNIT, Allahabad > > -- > 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]<algogeeks%[email protected]> > . > 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 [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?hl=en.
