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