An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- 1 April 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (2) , 313-323
- https://doi.org/10.1137/s0097539792226321
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Two-dimensional dictionary matchingInformation Processing Letters, 1992
- Fast parallel and serial multidimensional approximate array matchingTheoretical Computer Science, 1991
- Efficient and Elegant Subword-Tree ConstructionPublished by Springer Nature ,1985
- Open Problems in StringologyPublished by Springer Nature ,1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One DimensionSIAM Journal on Computing, 1978
- Two dimensional pattern matchingInformation Processing Letters, 1977
- A fast string searching algorithmCommunications of the ACM, 1977
- Efficient string matchingCommunications of the ACM, 1975