Constructing the suffix tree of a tree with a large alphabet

DOI10.1007/3-540-46632-0_24MaRDI QIDQ4511228zbMATH OpenFDO

Authors Tetsuo Shibuya

Publication date 8 July 2001

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

Full work available at URL https://doi.org/10.1007/3-540-46632-0_24

zbMATH Keywords

suffix tree

Mathematics Subject Classification ID

Data structures (68P05)

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

Cited in

(9)

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

This page was built for publication: Constructing the suffix tree of a tree with a large alphabet

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