Inverse Pattern Matching

Amihood Amir; Alberto Apostolico; Moshe Lewenstein

doi:10.1006/jagm.1996.0850

Inverse Pattern Matching

Amihood Amir
, Alberto Apostolico
, Moshe Lewenstein

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

5 Scopus citations

Abstract

Let a textstring T of n symbols from some alphabet ∑ and an integer m < n be given. A pattern P of length m over ∑ is sought such that P minimizes (alternatively, maximizes) the total number of pairwise character mismatches generated when P is compared with all m-character substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be (respectively, not be) a substring of T. Efficient sequential algorithms are proposed in this paper for the problem and its variants.

Original language	English
Pages (from-to)	325-339
Number of pages	15
Journal	Journal of Algorithms
Volume	24
Issue number	2
DOIs	https://doi.org/10.1006/jagm.1996.0850
State	Published - Aug 1997

Bibliographical note

Funding Information:
Let a textstring T of n symbols from some alphabet Σ and an integer m - n be given. A pattern P of length m over Σ is sought such that P minimizes alternatively, maximizes) the total number of pairwise character mismatches generated when P is compared with all m-character substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be respectively, not be) a substring of T. Efficient sequential algorithms are proposed in this paper for the problem and its variants. Q 1997 Academic Press * Partially supported by NSF Grant CCR-92-23699 and by Grant 6297 from the Israel Ministry of Science and the Arts. E-mail: [email protected]. ²Partially supported by NSF Grant CCR-92-01078, by NATO Grant CRG 900293, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the European Community under Contract 9072 Project GEPPCOM). E-mail: [email protected]. unipd.it. ³ E-mail: [email protected].

Funding

Let a textstring T of n symbols from some alphabet Σ and an integer m - n be given. A pattern P of length m over Σ is sought such that P minimizes alternatively, maximizes) the total number of pairwise character mismatches generated when P is compared with all m-character substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be respectively, not be) a substring of T. Efficient sequential algorithms are proposed in this paper for the problem and its variants. Q 1997 Academic Press * Partially supported by NSF Grant CCR-92-23699 and by Grant 6297 from the Israel Ministry of Science and the Arts. E-mail: [email protected]. ²Partially supported by NSF Grant CCR-92-01078, by NATO Grant CRG 900293, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the European Community under Contract 9072 Project GEPPCOM). E-mail: [email protected]. unipd.it. ³ E-mail: [email protected].

Funders	Funder number
ESPRIT III Basic Research Programme of the European Community	9072
National Science Foundation	6297, CCR-92-23699
North Atlantic Treaty Organization	CRG 900293
National Research Council
Ministry of science and technology, Israel	CCR-92-01078

Access to Document

10.1006/jagm.1996.0850

Cite this

@article{bb82a784a35445018f0806eb4a656c27,

title = "Inverse Pattern Matching",

abstract = "Let a textstring T of n symbols from some alphabet ∑ and an integer m < n be given. A pattern P of length m over ∑ is sought such that P minimizes (alternatively, maximizes) the total number of pairwise character mismatches generated when P is compared with all m-character substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be (respectively, not be) a substring of T. Efficient sequential algorithms are proposed in this paper for the problem and its variants.",

author = "Amihood Amir and Alberto Apostolico and Moshe Lewenstein",

note = "Funding Information: Let a textstring T of n symbols from some alphabet Σ and an integer m - n be given. A pattern P of length m over Σ is sought such that P minimizes alternatively, maximizes) the total number of pairwise character mismatches generated when P is compared with all m-character substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be respectively, not be) a substring of T. Efficient sequential algorithms are proposed in this paper for the problem and its variants. Q 1997 Academic Press * Partially supported by NSF Grant CCR-92-23699 and by Grant 6297 from the Israel Ministry of Science and the Arts. E-mail: [email protected]. ²Partially supported by NSF Grant CCR-92-01078, by NATO Grant CRG 900293, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the European Community under Contract 9072 Project GEPPCOM). E-mail: [email protected]. unipd.it. ³ E-mail: [email protected].",

year = "1997",

month = aug,

doi = "10.1006/jagm.1996.0850",

language = "אנגלית",

volume = "24",

pages = "325--339",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Elsevier Inc.",

number = "2",

}

TY - JOUR

T1 - Inverse Pattern Matching

AU - Amir, Amihood

AU - Apostolico, Alberto

AU - Lewenstein, Moshe

N1 - Funding Information: Let a textstring T of n symbols from some alphabet Σ and an integer m - n be given. A pattern P of length m over Σ is sought such that P minimizes alternatively, maximizes) the total number of pairwise character mismatches generated when P is compared with all m-character substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be respectively, not be) a substring of T. Efficient sequential algorithms are proposed in this paper for the problem and its variants. Q 1997 Academic Press * Partially supported by NSF Grant CCR-92-23699 and by Grant 6297 from the Israel Ministry of Science and the Arts. E-mail: [email protected]. ²Partially supported by NSF Grant CCR-92-01078, by NATO Grant CRG 900293, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the European Community under Contract 9072 Project GEPPCOM). E-mail: [email protected]. unipd.it. ³ E-mail: [email protected].

PY - 1997/8

Y1 - 1997/8

N2 - Let a textstring T of n symbols from some alphabet ∑ and an integer m < n be given. A pattern P of length m over ∑ is sought such that P minimizes (alternatively, maximizes) the total number of pairwise character mismatches generated when P is compared with all m-character substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be (respectively, not be) a substring of T. Efficient sequential algorithms are proposed in this paper for the problem and its variants.

AB - Let a textstring T of n symbols from some alphabet ∑ and an integer m < n be given. A pattern P of length m over ∑ is sought such that P minimizes (alternatively, maximizes) the total number of pairwise character mismatches generated when P is compared with all m-character substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be (respectively, not be) a substring of T. Efficient sequential algorithms are proposed in this paper for the problem and its variants.

UR - https://www.scopus.com/pages/publications/0347702236

U2 - 10.1006/jagm.1996.0850

DO - 10.1006/jagm.1996.0850

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

AN - SCOPUS:0347702236

SN - 0196-6774

VL - 24

SP - 325

EP - 339

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 2

ER -

Inverse Pattern Matching

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this