The suffix binary search tree and suffix AVL tree

DOI10.1016/S1570-8667(03)00034-0MaRDI QIDQ1827266zbMATH OpenFDO

Authors Robert W. Irving, Lorna Love

Publication date 6 August 2004

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1570-8667(03)00034-0

zbMATH Keywords

AVL treeBinary search treeString searchingSuffix arraySuffix tree

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Space efficient suffix trees
• The virtual suffix tree
• Suffix Arrays: A New Method for On-Line String Searches
• A time and space efficient data structure for string searching on large texts
• scientific article; zbMATH DE number 871936

Cites work

• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• On the sorting-complexity of suffix tree construction
• On-line construction of suffix trees
• Suffix Arrays: A New Method for On-Line String Searches
• Suffix trees on words
• The suffix binary search tree and suffix AVL tree

Cited in

(5)

• The suffix binary search tree and suffix AVL tree
• Extracting the sparse longest common prefix array from the suffix binary search tree
• Implementation of directed acyclic word graph.
• scientific article; zbMATH DE number 1794218 (Why is no real title available?)
• Breaking a barrier in constructing compact indexes for parameterized pattern matching

This page was built for publication: The suffix binary search tree and suffix AVL tree

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