Faster suffix tree construction with missing suffix links
From MaRDI portal
Publication:3192008
DOI10.1145/335305.335352zbMath1296.68032OpenAlexW2169767267MaRDI QIDQ3192008
Ramesh Hariharan, Richard John 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
Related Items
Efficient parameterized string matching, Variations of the parameterized longest previous factor, \(p\)-suffix sorting as arithmetic coding, On the Longest Common Parameterized Subsequence, Compressed parameterized pattern matching, Finding patterns and periods in Cartesian tree matching, Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications, Efficient pattern matching for RNA secondary structures, Fast parameterized matching with \(q\)-grams, Cartesian Tree Matching and Indexing, On the longest common parameterized subsequence, THE VIRTUAL SUFFIX TREE