One crude idea could be to generate permutations of all substrings of seq2 and then check if any of such permutations is a substring of seq1. Maintaining a count for chars in substring generated and updating it every time we get a higher value.
^thinking for better solution. On Tue, Jun 21, 2011 at 12:17 AM, aanchal goyal <goyal.aanch...@gmail.com> wrote: > Given two sequences of length N, how to find the max window of matching > patterns. The patterns can be mutated. > For example, seq1 = "ABCDEFG", seq2 = "DBCAPFG", then the max window is 4. > (ABCD from seq1 and DBCA from seq2) > > -- > Regards, > Aanchal Goyal. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- --Navneet -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
