Searching for a set of correlated patterns

Shmuel T. Klein; Riva Shalom; Yair Kaufman

doi:10.1016/j.jda.2006.02.002

Searching for a set of correlated patterns

Shmuel T. Klein, Riva Shalom, Yair Kaufman

Department of Computer Science

Bar-Ilan University

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	149-161
Number of pages	13
Journal	Journal of Discrete Algorithms
Volume	5
Issue number	1
DOIs	https://doi.org/10.1016/j.jda.2006.02.002
State	Published - Mar 2007

Keywords

Multiple patterns
NP-completeness
Overlaps
Pattern matching

Access to Document

10.1016/j.jda.2006.02.002

Cite this

@article{cc19847ecc20484fa59ba1b7750ebd26,

title = "Searching for a set of correlated patterns",

abstract = "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.",

keywords = "Multiple patterns, NP-completeness, Overlaps, Pattern matching",

author = "Klein, {Shmuel T.} and Riva Shalom and Yair Kaufman",

year = "2007",

month = mar,

doi = "10.1016/j.jda.2006.02.002",

language = "אנגלית",

volume = "5",

pages = "149--161",

journal = "Journal of Discrete Algorithms",

issn = "1570-8667",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Searching for a set of correlated patterns

AU - Klein, Shmuel T.

AU - Shalom, Riva

AU - Kaufman, Yair

PY - 2007/3

Y1 - 2007/3

N2 - 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.

AB - 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.

KW - Multiple patterns

KW - NP-completeness

KW - Overlaps

KW - Pattern matching

UR - http://www.scopus.com/inward/record.url?scp=33947598442&partnerID=8YFLogxK

U2 - 10.1016/j.jda.2006.02.002

DO - 10.1016/j.jda.2006.02.002

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33947598442

SN - 1570-8667

VL - 5

SP - 149

EP - 161

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

IS - 1

ER -

Searching for a set of correlated patterns

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this