Faster suffix tree construction with missing suffix links

DOI10.1145/335305.335352MaRDI QIDQ3192008zbMATH OpenOpenAlexFDO

Authors Ramesh Hariharan, Richard Cole

Publication date 26 September 2014

Published in Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL http://eprints.iisc.ac.in/306/1/ramesh.pdf

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Faster Suffix Tree Construction with Missing Suffix Links
• On-line construction of suffix trees
• On-line construction of parameterized suffix trees for large alphabets
• scientific article; zbMATH DE number 2102777
• Suffix trees on words

Cited in

(15)

• Efficient parameterized string matching
• Variations of the parameterized longest previous factor
• Faster Suffix Tree Construction with Missing Suffix Links
• The virtual suffix tree
• On the longest common parameterized subsequence
• p-suffix sorting as arithmetic coding
• Finding patterns and periods in Cartesian tree matching
• Compressed parameterized pattern matching
• Fast parameterized matching with \(q\)-grams
• Cartesian Tree Matching and Indexing
• On-line construction of parameterized suffix trees for large alphabets
• Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications
• Efficient pattern matching for RNA secondary structures
• Computing suffix links for suffix trees and arrays
• On the Longest Common Parameterized Subsequence

This page was built for publication: Faster suffix tree construction with missing suffix links

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