Activities per year
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 mcharacter
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 . Effacement sequential algorithms are
proposed in this paper for the problem and its variants.
Key Words: Design and analysis of algorithms, combinatorial algorithms on words, pattern
matching, inverse pattern matching, Hamming distance, digital signature.
Original language | American English |
---|---|
State | Published - 1995 |
Event | Israel-Germany Workshop on Computational Aspects of Molecular Biology - Tel Aviv, Israel Duration: 1 Nov 1995 → 1 Nov 1995 |
Conference
Conference | Israel-Germany Workshop on Computational Aspects of Molecular Biology |
---|---|
Country/Territory | Israel |
City | Tel Aviv |
Period | 1/11/95 → 1/11/95 |
Fingerprint
Dive into the research topics of 'Inverse Pattern Matching'. Together they form a unique fingerprint.Activities
- 1 Invited talk
-
Conference Invited Keynote
Amir, A. (Keynote speaker)
1 Nov 1995Activity: Talk or presentation › Invited talk