if you want the longest common subsecuence is a dynamic problem, there is a algorithm O(n*n) but you can solve it in (nlogn) with suffix array...
If you want the longest substring read about suffix array, search in google about it!!!, "chococontest suffix array" <- there is a good tutorial.... 2011/9/13 Sanjay Rajpal <[email protected]> > A dynamic programming problem . > > > Sanju > :) > > > > On Tue, Sep 13, 2011 at 9:34 AM, prasanth n <[email protected]> wrote: > >> use dynamic programming.. >> >> >> On Sun, Sep 4, 2011 at 6:46 PM, aditya kumar < >> [email protected]> wrote: >> >>> How to find longest common substring in two strings ? >>> i want efficent code and iff possible any method other than using suffix >>> tree . >>> >>> -- >>> 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. >>> >> >> >> >> -- >> *prasanth* >> >> -- >> 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. > -- Victor Manuel Grijalva Altamirano Universidad Tecnologica de La Mixteca -- 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.
