That phrasing may not have been overly helpful... but it's not a bad idea. The SO thread that poj mentioned in the similar Re: Longest common substring with N mismatches points out Bio::Grep::Backend::Agrep, whose synopsis reads to me like it probably does what the OP wants. The parent module Bio::Grep is what actually gets use'd, and lists some of the abilities of the various back-end modules, so the OP might want to check out that page as well for other pertinent information.
In reply to Re^3: How do you match a stretch of at least N characters
by pryrt
in thread How do you match a stretch of at least N characters
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |