Regarding the explanation of the suffix tree method, here is the link: http://algo2006.csie.dyu.edu.tw/paper/2/A24.pdf
On Tue, Jan 24, 2012 at 8:05 PM, Ashish Goel <[email protected]> wrote: > http://www.akalin.cx/longest-palindrome-linear-time > > lovely explanation.. > > Best Regards > Ashish Goel > "Think positive and find fuel in failure" > +919985813081 > +919966006652 > > > On Tue, Jan 24, 2012 at 7:52 PM, Ashish Goel <[email protected]> wrote: > >> while suffix tree of str and reverse(str) and finding deepst fork to get >> the palindrome works, there is a solution available at >> http://johanjeuring.blogspot.com/2007/08/finding-palindromes.html >> which is O(n). Can anyone explain this, a bit complex for me. >> >> Best Regards >> Ashish Goel >> "Think positive and find fuel in failure" >> +919985813081 >> +919966006652 >> > > -- > 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. > -- 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.
