ricky Tue, 24 Jan 2006 05:50:54 -0800
you can store the two strings in an upside down suffix tree. a simple edge scan of common path will give you all possible (and largest) common substring
