Two-dimensional pattern matching on a dynamic library of texts

DOI10.1007/bfb0030874zbMath1527.68047DBLPconf/cocoon/ChoiL95OpenAlexW1534977043WikidataQ58063093 ScholiaQ58063093MaRDI QIDQ6085750

Unnamed Author, Tak-Wah Lam

Publication date: 12 December 2023

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

Full work available at URL: https://doi.org/10.1007/bfb0030874

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• A data structure for dynamic trees
• A Space-Economical Suffix Tree Construction Algorithm
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• An index data structure for matrices, with applications to fast two-dimensional pattern matching
• Multiple matching of rectangular patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two-dimensional pattern matching on a dynamic library of texts