laziness, impatience, and hubris | |
PerlMonks |
Re^2: longest common substringby lima1 (Curate) |
on Jan 02, 2008 at 18:41 UTC ( [id://660029]=note: print w/replies, xml ) | Need Help?? |
For more than 2 strings, I'd also suggest Tree::Suffix (although I've never used this module. It is just in theory the best algorithm).
In Section
Seekers of Perl Wisdom
|
|