Skip to main content
SpringerLink
Log in

Space-Efficient Construction Algorithm for the Circular Suffix Tree

  • Conference paper
Combinatorial Pattern Matching (CPM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7922))

Included in the following conference series:

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(nlogσ + dlogn) bits of working space, where n is the total length of the patterns in \(\mathcal D\), d is the number of patterns in \(\mathcal{D}\), and σ is the alphabet size.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A., Corasick, M.: Efficient String Matching: An Aid to Bibligoraphic Search. Communications of the ACM 18(6), 333–340 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  2. Belazzougui, D.: Succinct Dictionary Matching with No Slowdown. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 88–100. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Chan, H.L., Hon, W.K., Lam, T.W., Sadakane, K.: Compressed Indexes for Dynamic Text Collections. ACM Transactions on Algorithms 3(2) (2007)

    Google Scholar 

  4. Elias, P.: Universal Codeword Sets and Representations of the Integers. IEEE Transactions on Information Theory 21(2), 194–203 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hon, W.K.: On the Construction and Application of Compressed Text Indexes. PhD Thesis, Department of Computer Science, University of Hong Kong (2004)

    Google Scholar 

  6. Hon, W.-K., Ku, T.-H., Shah, R., Thankachan, S.V., Vitter, J.S.: Faster Compressed Dictionary Matching. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 191–200. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Hon, W.-K., Ku, T.-H., Lu, C.-H., Shah, R., Thankachan, S.V.: Efficient Algorithm for Circular Burrows-Wheeler Transform. In: Kärkkäinen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 257–268. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Hon, W.K., Lam, T.W., Sadakane, K., Sung, W.K., Yiu, S.M.: A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. Algorithmica 48(1), 22–36 (2007)

    Article  MathSciNet  Google Scholar 

  9. Hon, W.-K., Lu, C.-H., Shah, R., Thankachan, S.V.: Succinct Indexes for Circular Patterns. In: Asano, T., Nakano, S.-I., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 673–682. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Iliopoulos, C.S., Rahman, M.S.: Indexing circular patterns. In: Nakano, S.-I., Rahman, M.S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 46–57. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Jacobson, G.: Space-efficient Static Trees and Graphs. In: Proc. FOCS, pp. 549–554 (1989)

    Google Scholar 

  12. Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181–192. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An Extension of the Burrows Wheeler Transform. Theoretical Computer Science 387(3), 298–312 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. McCreight, E.M.: A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM 23(2), 262–272 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  15. Munro, J.I., Raman, V.: Succinct Representation of Balanced Parentheses and Static Trees. SIAM Journal on Computing 31(3), 762–776 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  16. Sadakane, K.: Compressed Suffix Trees with Full Functionality. Theory of Computing System 41(4), 589–607 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  17. Sadakane, K., Navarro, G.: Fully-Functional Succinct Trees. In: Proc. SODA, pp. 134–149 (2010)

    Google Scholar 

  18. Weiner, P.: Linear Pattern Matching Algorithms. In: Proc. Switching and Automata Theory, pp. 1–11 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Tsing Hua University, Taiwan

    Wing-Kai Hon & Tsung-Han Ku

  2. Louisiana State University, USA

    Rahul Shah & Sharma V. Thankachan

Authors
  1. Wing-Kai Hon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tsung-Han Ku
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rahul Shah
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sharma V. Thankachan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Informatik, Institut für Theoretische Informatik, Karlsruhe Institut für Technology, Am Fasanengarten 5, 76131, Karlsruhe, Germany

    Johannes Fischer

  2. Karlsruhe Institute of Technology, Germany

    Peter Sanders

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hon, WK., Ku, TH., Shah, R., Thankachan, S.V. (2013). Space-Efficient Construction Algorithm for the Circular Suffix Tree. In: Fischer, J., Sanders, P. (eds) Combinatorial Pattern Matching. CPM 2013. Lecture Notes in Computer Science, vol 7922. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38905-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38905-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38904-7

  • Online ISBN: 978-3-642-38905-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation