A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension

DOI10.1137/0207043zbMath0387.68031OpenAlexW2111297109MaRDI QIDQ4168066

Theodore P. Baker

Publication date: 1978

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0207043

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Data structures (68P05) Algorithms in computer science (68W99)

Related Items (27)

On two-dimensional pattern matching by optimal parallel algorithms ⋮ Parallel two dimensional witness computation ⋮ Indexing and querying color sets of images ⋮ Fast algorithms for two dimensional and multiple pattern matching ⋮ An index data structure for matrices, with applications to fast two-dimensional pattern matching ⋮ Faster two-dimensional pattern matching with rotations ⋮ Periodicity in rectangular arrays ⋮ Succinct 2D dictionary matching ⋮ The submatrices character count problem: An efficient solution using separable values ⋮ On linear-time alphabet-independent 2-dimensional pattern matching ⋮ Two-dimensional pattern matching on a dynamic library of texts ⋮ Unnamed Item ⋮ Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton ⋮ Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays ⋮ THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW ⋮ 2D Lyndon words and applications ⋮ Motif patterns in 2D ⋮ A sheaf-theoretic approach to pattern matching and related problems ⋮ Two-dimensional pattern matching by sampling ⋮ Fast two-dimensional pattern matching ⋮ Two-dimensional dictionary matching ⋮ Approximation algorithms for maximum two-dimensional pattern matching ⋮ Fast parallel and serial multidimensional approximate array matching ⋮ Optimal parallel two dimensional text searching on a CREW PRAM ⋮ Alphabet-independent optimal parallel search for three-dimensional patterns ⋮ Complexity of Sets of Two-Dimensional Patterns ⋮ Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors

This page was built for publication: A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension