On Wednesday, April 25, 2012 at 8:52 AM, Paul Clark wrote: > Any suggestions for a more elegant solution? What you have there looks like an example of the 'Longest Common Substring Problem' -- http://www.softpanorama.org/Algorithms/lcs.shtml
Seems like String::LCSS will help -- https://metacpan.org/module/String::LCSS chrs, john.
