Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms

DOI10.1006/jagm.1996.0844zbMath0889.68039OpenAlexW2031567749MaRDI QIDQ4360129

Roberto Grossi, Raffaele Giancarlo

Publication date: 11 June 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1996.0844

zbMATH Keywords

pattern matching problemdecision query

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics on words (68R15) Data structures (68P05)

Related Items (5)

TREE-BASED 2D INDEXING ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ A Note on a Tree-Based 2D Indexing ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Parallel construction and query of index data structures for pattern matching on square matrices

This page was built for publication: Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms