first of all ,its not suffix array bt suffix tree..vich i mistyped...sorry 4 dat..n yeah!!! d question demands the same....bt d same question cud also b solved by suffix trees the implementation of vich i require as there is some flaw in ma implementation... so ,i vud b thankful if ny has shares dat. Regards, PAYAL GUPTA
On Sat, Mar 10, 2012 at 10:12 AM, Sonia Keys <[email protected]> wrote: > This? http://en.wikipedia.org/wiki/Longest_common_substring_problem > > On Friday, March 9, 2012 2:30:57 PM UTC-5, payal gupta wrote: >> >> >> find the efficient implementation to find longest common contiguous >> intersection from 2 lists provided to the function. >> Example: list1: abcrfghwetf >> list2: abrfghwwetxyab >> >> Longest common intersection here is: rfghw >> >> need the suffix array implementation in c... >> thnx..in advance!! >> >> >> >> >> >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/k9wuU0jTB4QJ. > > 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.
