Multiple matching of rectangular patterns

DOI10.1145/167088.167116zbMATH Open1310.68111OpenAlexW2025969487MaRDI QIDQ5248474FDOQ5248474

Authors: Ramana M. Idury, Alejandro A. Schäffer 

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Cited In (6)

• An index data structure for matrices, with applications to fast two-dimensional pattern matching
• Alphabet dependence in parameterized matching
• Dynamic suffix tree and two-dimensional texts management
• Two-dimensional pattern matching on a dynamic library of texts
• Real two dimensional scaled matching
• On-line construction of two-dimensional suffix trees

This page was built for publication: Multiple matching of rectangular patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248474)