Multiple matching of rectangular patterns
From MaRDI portal
Publication:5248474
DOI10.1145/167088.167116zbMath1310.68111OpenAlexW2025969487MaRDI QIDQ5248474
Alejandro A. Schäffer, Ramana M. Idury
Publication date: 7 May 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/167088.167116
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms on strings (68W32)
Related Items (6)
Dynamic suffix tree and two-dimensional texts management ⋮ An index data structure for matrices, with applications to fast two-dimensional pattern matching ⋮ Two-dimensional pattern matching on a dynamic library of texts ⋮ On-line construction of two-dimensional suffix trees ⋮ Real two dimensional scaled matching ⋮ Alphabet dependence in parameterized matching
This page was built for publication: Multiple matching of rectangular patterns