Searching for a set of correlated patterns

Shmuel T. Klein, Riva Shalom, Yair Kaufman

Research output: Contribution to journalArticlepeer-review


New algorithms for searching simultaneously for a set of patterns in a text are suggested, for the special case where these patterns are correlated and have a common substring. This is then extended to the case where it could be more profitable to look for more than a single overlap, and a problem related to the generalization of this idea is shown to be NP-complete. Experimental results suggest that for this particular application, the suggested algorithm yields significant improvements over previous methods.

Original languageEnglish
Pages (from-to)149-161
Number of pages13
JournalJournal of Discrete Algorithms
Issue number1
StatePublished - Mar 2007


  • Multiple patterns
  • NP-completeness
  • Overlaps
  • Pattern matching


Dive into the research topics of 'Searching for a set of correlated patterns'. Together they form a unique fingerprint.

Cite this