On the construction of classes of suffix trees for square matrices: Algorithms and applications

DOI10.1007/3-540-60084-1_67zbMath1412.68050OpenAlexW1749627042MaRDI QIDQ4645171

Roberto Grossi, Raffaele Giancarlo

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_67

zbMATH Keywords

linear representationsuffix arraysuffix treesuccinct representationonion peeling

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel construction of a suffix tree with applications
• Organization and maintenance of large ordered indexes
• Suffix Arrays: A New Method for On-Line String Searches
• A Space-Economical Suffix Tree Construction Algorithm
• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
• An index data structure for matrices, with applications to fast two-dimensional pattern matching

This page was built for publication: On the construction of classes of suffix trees for square matrices: Algorithms and applications