Rui Feng Zhu
Abstract
By reducing an array matching problem to a string matching problem in a natural way, it is shown that efficient string matching algorithms can be applied to arrays, assuming that a linear preprocessing is made on the text.
- 1 Aho, A.V., and Corasick, M.J. Efficient string matching: An aid to bibliographic search. Commun. ACM 18, 6 (June 1975), 333-340. Google Scholar
Digital Library
- 2 Apostolico, A., and Giancarlo, R. The Boyer-Moore-Galli string ';earching strategies revisited. SIAM J. Comput. 15, I (Feb. 1986), 98-105. Google ScholarDigital Library
- 3 Baker, T.P. A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput. 7, ,3 (Nov. 1978), 533-541.Google Scholar
- 4 Bird, R.S. Two dimensional pattern matching. Info. Process. Lett. 6, 5 (Oct. 1977), 168-170.Google ScholarCross Ref
- 5 Boyer, R.S., and Moore, J.S. A fast matching algorithm. Commun. ACM 20, 10 (Oct. 1977), 762-772. Google ScholarDigital Library
- 6 Davies, G., and Bowsber, S. Algorithms for pattern matching. Softw. Pract. Exper. 16, 6 (June 1986), 575-601. Google ScholarDigital Library
- 7 Galil, Z. On improving the worst case running time of the Boyerlvloore string matching algorithm. Commun. ACM 22, 9 (Sept. 1979), 505-508. Google ScholarDigital Library
- 8 Knuth, D.E., Morris, J.H., and Pratt, V.R. Fast pattern matching in ,,;trings. SIAM }. Comput. 6, 2 (June 1977), 323-350.Google Scholar
- 9 Zhu, R. F., and Takaoka, T. On improving the average case of the Boyer-Moore string matching algorithm. }. Inf. Process. 10, 3 (Mar. 1987), 173-177. Google ScholarDigital Library
Index Terms
- A technique for two-dimensional pattern matching
Recommendations
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
Baker and Bird and Baeza-Yates and Regnier are two of the most efficient and widely used algorithms for exact online two-dimensional pattern matching. Both use the automaton of the Aho-Corasick multiple pattern matching algorithm to locate all the ...
The Design of Efficient Algorithms for Two-Dimensional Pattern Matching
The two-dimensional pattern matching problem is to find the occurrences of a given two-dimensional pattern array in a two-dimensional text array. This paper presents two efficient algorithms, which combine Fan-Su and Aho-Corasick string search ...
Order-preserving pattern matching with scaling
AbstractGiven a text T and a pattern P, the order-preserving pattern matching (OPPM for short) problem is to find all substrings of T which have the same relative orders as P. Recently, approximate OPPM that allows errors have been studied ...
Highlights- We propose a novel criteria for approximate order-preserving pattern matching.
- ...
Comments