Faster suffix tree construction with missing suffix links
From MaRDI portal
Publication:3192008
DOI10.1145/335305.335352zbMATH Open1296.68032OpenAlexW2169767267MaRDI QIDQ3192008FDOQ3192008
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
Recommendations
Cited In (15)
- Efficient parameterized string matching
- Faster Suffix Tree Construction with Missing Suffix Links
- Variations of the parameterized longest previous factor
- 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
- Cartesian Tree Matching and Indexing
- Fast parameterized matching with \(q\)-grams
- 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)
