On Thu, 14 Feb 2002, Daniel R. Allen wrote: > Hi, > > Somebody asked on the Toronto Perlmongers list about finding the longest > common (consecutive) substring of two thousand-character texts using perl. > I've given a quick search and can find nothing definitive. [1] >
What exactly are the rules? The reference [1] seems to be looking for the common substring to occur in the same place in the two strings. But in your case, do you allow the common parts to occur anywhere within the two strings? -- Stephen Turner, Cambridge, UK http://homepage.ntlworld.com/adelie/stephen/ "This is Henman's 8th Wimbledon, and he's only lost 7 matches." BBC, 2/Jul/01
