Abstract
In this paper we consider the external inverse pattern matching problem. Given a text T of lengthn over an ordered alphabet Σ and a number m ≤ n, the goal is to find a pattern (formula presented)MAX ∈ Σm which is not a subword of T and which maximizes the sum of Hamming distances between (formula presented)MAX and all subwords of T of length m. We present an optimal O(n log σ)-time (where σ = ∣Σ∣) algorithm for the external inverse pattern matching problem. This substantially improves the O(nm log σ)-time algorithm given in [2]. Moreover we discuss briefly fast parallel implementation of our algorithm on the CREW PRAM model.
Cite
CITATION STYLE
Gąsieniec, L., Indyk, P., & Krysta, P. (1997). External inverse pattern matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1264, pp. 90–101). Springer Verlag. https://doi.org/10.1007/3-540-63220-4_53
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
