Dynamic suffix tree and two-dimensional texts management

DOI10.1016/S0020-0190(97)00018-5zbMath1336.68044OpenAlexW2050670542MaRDI QIDQ287000

F. Blanchet-Sadri, M. Dambrine

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• A data structure for dynamic trees
• A Space-Economical Suffix Tree Construction Algorithm
• A Generalization of the Suffix Tree to Square Matrices, with Applications
• An index data structure for matrices, with applications to fast two-dimensional pattern matching
• Multiple matching of rectangular patterns

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