Using suffix tree, can be solved in O(n)... On 11/28/07, John <[EMAIL PROTECTED]> wrote: > > > Algorithm for finding out the longest palindrome in a given string > using dynamic programming > > > >
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
