Two-dimensional pattern matching on a dynamic library of texts

DOI10.1007/BFB0030874MaRDI QIDQ6085750zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Y. Choi, 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)

Recommendations

• Dynamic suffix tree and two-dimensional texts management
• Two-dimensional dynamic dictionary matching
• scientific article; zbMATH DE number 437565
• A Generalization of the Suffix Tree to Square Matrices, with Applications
• scientific article; zbMATH DE number 1445383

Cites work

• scientific article; zbMATH DE number 432781 (Why is no real title available?)
• scientific article; zbMATH DE number 437564 (Why is no real title available?)
• scientific article; zbMATH DE number 437565 (Why is no real title available?)
• scientific article; zbMATH DE number 3898807 (Why is no real title available?)
• scientific article; zbMATH DE number 1256660 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• A data structure for dynamic trees
• An index data structure for matrices, with applications to fast two-dimensional pattern matching
• Multiple matching of rectangular patterns

Cited in

(1)

• Dynamic and approximate pattern matching in 2D

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

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