scientific article; zbMATH DE number 1522932

zbMATH Open0964.68034MaRDI QIDQ4511228FDOQ4511228

Authors: Tetsuo Shibuya 

Publication date: 8 July 2001

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2102777
• Suffix trees on words
• Fast construction of generalized suffix trees over a very large alphabet
• On the sorting-complexity of suffix tree construction
• On-line construction of suffix trees

zbMATH Keywords

suffix tree

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (9)

• Efficiently computing runs on a trie
• Suffix trees for partial words and the longest common compatible prefix problem
• Fast construction of generalized suffix trees over a very large alphabet
• On suffix extensions in suffix trees
• Longest common extensions in trees
• Longest common extensions in trees
• Efficient counting of square substrings in a tree
• Computing runs on a trie
• String covers of a tree revisited

This page was built for publication:

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