The substring problem is solvable in linear time with suffix arrays/trees. Tree::Suffix claims to have this function.
In reply to Re^3: Finding a LCS module on word level
by lima1
in thread Finding a LCS module on word level
by st_ale
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |