An index data structure for matrices, with applications to fast two-dimensional pattern matching

DOI10.1007/3-540-57155-8_260zbMath1504.68047OpenAlexW1498912129MaRDI QIDQ5060126

Raffaele Giancarlo

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_260

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (4)

On the construction of classes of suffix trees for square matrices: Algorithms and applications ⋮ Dynamic suffix tree and two-dimensional texts management ⋮ Two-dimensional pattern matching on a dynamic library of texts ⋮ Parallel construction and query of index data structures for pattern matching on square matrices

Cites Work

• A Space-Economical Suffix Tree Construction Algorithm
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• Multiple matching of rectangular patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An index data structure for matrices, with applications to fast two-dimensional pattern matching