Space-efficient construction algorithm for the circular suffix tree
Document Type
Conference Proceeding
Publication Date
9-24-2013
Abstract
Hon et al. (2011) proposed a variant of the suffix tree, called circular suffix tree, and showed that it can be stored succinctly and can be used to solve the circular dictionary matching problem efficiently. In this paper, we give the first construction algorithm for the circular suffix tree, which takes O(nlogn) time and requires O(n log σ + d log n) bits of working space, where n is the total length of the patterns in D, d is the number of patterns in D, and σ is the alphabet size. © 2013 Springer-Verlag.
Publication Source (Journal or Book title)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
First Page
142
Last Page
152
Recommended Citation
Hon, W., Ku, T., Shah, R., & Thankachan, S. (2013). Space-efficient construction algorithm for the circular suffix tree. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7922 LNCS, 142-152. https://doi.org/10.1007/978-3-642-38905-4_15
