Abstract
In this paper we consider the external inverse pattern matching problem. Given a text T of length n over an ordered alphabet Σ and a number m≤n, the goal is to find a pattern \(\mathop {\mathcal{P}_{MAX} }\limits^ \sim\) ∈ Σ m which is not a subword of T and which maximizes the sum of Hamming distances between \(\mathop {\mathcal{P}_{MAX} }\limits^ \sim\) 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.
Research of this author was partially supported by KBN grant 2 P301 034 07.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, Generalized String Matching, SIAM Journal on Computing, 16(6):1039–1051, 1987.
Amihood Amir, Alberto Apostolico and Moshe Lewenstein, Inverse Pattern Matching, Manuscript, to appear in Journal of Algorithms.
A. Apostolico, C. Ilioppoulos, G.M. Landau, B. Schieber and U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica, 3:347–365, 1988.
R. Cole, Parallel merge sort, SIAM, J. Computing, 4(1988), pp 770–785.
M.J. Fischer and M.S. Paterson, String matching and other products, Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings, 7:113–125, 1974.
E. Fredkin, Trie Memory, Communications of the ACM, 3:490–499, 1962.
H.N. Gabow, J.L. Bentley and R.E. Tarjan, Scaling and related techniques for geometry problems, In Proceedings of 16th ACM Symposium on Theory of Computing (STOC), pp. 135–143, 1984.
A. Gibbons and W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, 1988.
R.W. Hamming, Error detecting and error correcting codes, Bell. Sys. Tech. Journal, 26(2): 147–160, 1950.
D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing, 13:338–355, 1984.
H. Karloff, Fast algorithms for approximately counting mismatches, Information Processing Letters, 48(2):53–60, 1993.
D.E. Knuth, J.H. Morris, and V.B. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977), 323–350.
B. Schieber and U. Vishkin, On finding lower common ancestors: simplification and parallelization, In Proceedings of 3rd Aegean Workshop on VLSI Algorithms and Architecture, LNCS 319:111–123, 1988.
P. Weiner, Linear pattern matching algorithms, In Proceedings of 14th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1–11, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gasieniec, L., Indyk, P., Krysta, P. (1997). External inverse pattern matching. In: Apostolico, A., Hein, J. (eds) Combinatorial Pattern Matching. CPM 1997. Lecture Notes in Computer Science, vol 1264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63220-4_53
Download citation
DOI: https://doi.org/10.1007/3-540-63220-4_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63220-7
Online ISBN: 978-3-540-69214-0
eBook Packages: Springer Book Archive