Dynamic suffix tree and two-dimensional texts management

DOI10.1016/S0020-0190(97)00018-5MaRDI QIDQ287000zbMATH OpenOpenAlexFDO

Authors Y. Choi, Tak-Wah Lam

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00018-5

zbMATH Keywords

data structurespattern matchingdictionary problemsuffix treestwo-dimensional information retrieval

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• Two-dimensional dynamic dictionary matching
• Dynamic Text Indexing under String Updates
• scientific article; zbMATH DE number 1003303
• Dynamic dictionary matching and compressed suffix trees
• scientific article; zbMATH DE number 437565

Cites work

• scientific article; zbMATH DE number 437564 (Why is no real title available?)
• scientific article; zbMATH DE number 437565 (Why is no real title available?)
• A Generalization of the Suffix Tree to Square Matrices, with Applications
• A Space-Economical Suffix Tree Construction Algorithm
• 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

(3)

• Two-dimensional dynamic dictionary matching
• The Property Suffix Tree with Dynamic Properties
• Two-dimensional pattern matching on a dynamic library of texts

This page was built for publication: Dynamic suffix tree and two-dimensional texts management

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