Balanced suffix trees. (Invited lecture)

DOI10.1007/3-540-48194-X_21MaRDI QIDQ4552404zbMATH OpenFDO

Authors S. R. Kosaraju

Publication date 2 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48194-X_21

Mathematics Subject Classification ID

Data structures (68P05) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 871936
• A time and space efficient data structure for string searching on large texts
• The suffix binary search tree and suffix AVL tree
• Space efficient suffix trees
• Suffix trees on words

This page was built for publication: Balanced suffix trees. (Invited lecture)

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