article

Free access

A technique for two-dimensional pattern matching

Authors:

Rui Feng Zhu,

Tadao TakaokaAuthors Info & Claims

Communications of the ACM, Volume 32, Issue 9

Pages 1110 - 1120

https://doi.org/10.1145/66451.66459

Published: 01 September 1989 Publication History

PDF eReader

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.

References

[1]

Aho, A.V., and Corasick, M.J. Efficient string matching: An aid to bibliographic search. Commun. ACM 18, 6 (June 1975), 333-340.

Digital Library

Google Scholar

[2]

Apostolico, A., and Giancarlo, R. The Boyer-Moore-Galli string ';earching strategies revisited. SIAM J. Comput. 15, I (Feb. 1986), 98-105.

Digital Library

Google Scholar

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

Crossref

Google Scholar

[5]

Boyer, R.S., and Moore, J.S. A fast matching algorithm. Commun. ACM 20, 10 (Oct. 1977), 762-772.

Digital Library

Google Scholar

[6]

Davies, G., and Bowsber, S. Algorithms for pattern matching. Softw. Pract. Exper. 16, 6 (June 1986), 575-601.

Digital Library

Google Scholar

[7]

Galil, Z. On improving the worst case running time of the Boyerlvloore string matching algorithm. Commun. ACM 22, 9 (Sept. 1979), 505-508.

Digital Library

Google Scholar

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

Digital Library

Google Scholar

Cited By

View all

Dillahunt TMueller SBaudisch P(2017)Research for Practice: Technology for UnderservedCommunities; Personal FabricationQueue10.1145/3084693.310583015:2(96-110)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1145/3084693.3105830
Helland P(2017)Side Effects, Front and Center!Queue10.1145/3084693.309956115:2(5-9)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1145/3084693.3099561
Matsudaira K(2017)Conversations with Technology Leaders: Erik MeijerQueue10.1145/3084693.309295415:2(14-23)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1145/3084693.3092954
Show More Cited By

Index Terms

A technique for two-dimensional pattern matching
1. Applied computing
  1. Document management and text processing
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. 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
Abstract
Given 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

Information & Contributors

Information

Published In

Communications of the ACM Volume 32, Issue 9

Special issue: multiprocessing

Sept. 1989

93 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/66451

Editor:
Peter J. Denning
NASA Ames Research Center, Moffett Field, CA

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1989

Published in CACM Volume 32, Issue 9

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

60
Total Citations
View Citations
1,168
Total Downloads

Downloads (Last 12 months)144
Downloads (Last 6 weeks)29

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dillahunt TMueller SBaudisch P(2017)Research for Practice: Technology for UnderservedCommunities; Personal FabricationQueue10.1145/3084693.310583015:2(96-110)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1145/3084693.3105830
Helland P(2017)Side Effects, Front and Center!Queue10.1145/3084693.309956115:2(5-9)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1145/3084693.3099561
Matsudaira K(2017)Conversations with Technology Leaders: Erik MeijerQueue10.1145/3084693.309295415:2(14-23)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1145/3084693.3092954
Sadeghi SBlanco RMika PSanderson MScholer FVallet D(2017)Re-Finding Behaviour in Vertical DomainsACM Transactions on Information Systems10.1145/297559035:3(1-30)Online publication date: 5-Jun-2017
https://dl.acm.org/doi/10.1145/2975590
Průša D(2017)Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation AutomatonInternational Journal of Foundations of Computer Science10.1142/S012905411740010X28:05(623-640)Online publication date: Aug-2017
https://doi.org/10.1142/S012905411740010X
Popescu S(2017)Solving 2-D Pattern Matching using Networks of Polarized Picture Processors with Circular Permutation2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)10.1109/SYNASC.2017.00061(338-343)Online publication date: Sep-2017
https://doi.org/10.1109/SYNASC.2017.00061
Bordihn HBottoni PLabella AMitrana V(2017)Networks of picture processors as problem solversSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-016-2206-y21:19(5529-5541)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s00500-016-2206-y
Han YPrůša D(2017)Template-Based Pattern Matching in Two-Dimensional ArraysCombinatorial Image Analysis10.1007/978-3-319-59108-7_7(79-92)Online publication date: 17-May-2017
https://doi.org/10.1007/978-3-319-59108-7_7
Zhu HErez M(2016)DirigentACM SIGPLAN Notices10.1145/2954679.287239451:4(33-47)Online publication date: 25-Mar-2016
https://dl.acm.org/doi/10.1145/2954679.2872394
Kim WKim JBaek WNam BWon Y(2016)NVWALACM SIGPLAN Notices10.1145/2954679.287239251:4(385-398)Online publication date: 25-Mar-2016
https://dl.acm.org/doi/10.1145/2954679.2872392
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Exact online two-dimensional pattern matching using multiple pattern matching algorithms

The Design of Efficient Algorithms for Two-Dimensional Pattern Matching

Order-preserving pattern matching with scaling

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations