Skip to main content
SpringerLink
Log in

Parallel Construction of Succinct Representations of Suffix Tree Topologies

  • Conference paper
  • First Online:
Book cover String Processing and Information Retrieval (SPIRE 2015)

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

Included in the following conference series:

  • International Symposium on String Processing and Information Retrieval

Abstract

A compressed suffix tree usually consists of three components: a compressed suffix array, a compressed \(\mathsf {LCP}\)-array, and a succinct representation of the suffix tree topology. There are parallel algorithms that construct the suffix array and the \(\mathsf {LCP}\)-array, but none for the third component. In this paper, we present parallel algorithms on shared memory architectures that construct the enhanced balanced parentheses representation (\(\mathsf {BPR}\)). The enhanced \(\mathsf {BPR}\) is an implicit succinct representation of the suffix tree topology, which supports all navigational operations on the suffix tree. It can also be used to efficiently construct the \(\mathsf {BPS}\), an explicit succinct representation of the suffix tree topology.

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 54.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. Berkman, O., Schieber, B., Vishkin, U.: Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Journal of Algorithms 14(3), 344–370 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  2. Deo, M., Keely, S.: Parallel suffix array and least common prefix for the GPU. ACM SIGPLAN Notices 48(8), 197–206 (2013)

    Article  Google Scholar 

  3. Fischer, J.: Combined data structure for previous- and next-smaller-values. Theoretical Computer Science 412(22), 2451–2456 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gog, S.: Compressed Suffix Trees: Design, Construction, and Applications. PhD thesis, University of Ulm, Germany (2011)

    Google Scholar 

  5. Hon, W.-K., Sadakane, K.: Space-Economical algorithms for finding maximal unique matches. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 144–152. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Jaja, J.: Introduction to Parallel Algorithms. Addison-Wesley Professional (1992)

    Google Scholar 

  7. Kärkkäinen, J., Manzini, G., Puglisi, S.J.: Permuted longest-common-prefix array. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol. 5577, pp. 181–192. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Léonard, M., Mouchard, L., Salson, M.: On the number of elements to reorder when updating a suffix array. Journal of Discrete Algorithms 11, 87–99 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. 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 

  10. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1), Article 2 (2007)

    Google Scholar 

  11. Ohlebusch, E.: Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction. Oldenbusch Verlag (2013)

    Google Scholar 

  12. Ohlebusch, E., Fischer, J., Gog, S.: CST++. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 322–333. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Ohlebusch, E., Gog, S.: A compressed enhanced suffix array supporting fast string matching. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 51–62. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Puglisi, S.J., Smyth, W.F., Turpin, A.: A taxonomy of suffix array construction algorithms. ACM Computing Surveys 39(2), Article 4 (2007)

    Google Scholar 

  15. Sadakane, K.: Succinct representations of lcp information and improvements in the compressed suffix arrays. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 225–232 (2002)

    Google Scholar 

  16. Sadakane, K.: Compressed suffix trees with full functionality. Theory of Computing Systems 41, 589–607 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  17. Shun, J.: Fast parallel computation of longest common prefixes. In: Proc. International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 387–398. IEEE Press (2014)

    Google Scholar 

  18. Shun, J., Blelloch, G.E.: A simple parallel Cartesian tree algorithm and its application to suffix tree construction. ACM Transactions on Parallel Computing 1(1), Article 8 (2014)

    Google Scholar 

  19. Shun, J., Zhao, F.: Practical parallel Lempel-Ziv factorization. In: Proc. 23th Data Compression Conference, pp. 123–132. IEEE Computer Society (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Theoretical Computer Science, Ulm University, 89069, Ulm, Germany

    Uwe Baier, Timo Beller & Enno Ohlebusch

Authors
  1. Uwe Baier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Timo Beller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Enno Ohlebusch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Enno Ohlebusch .

Editor information

Editors and Affiliations

  1. King's College London, London, United Kingdom

    Costas Iliopoulos

  2. University of Helsinki, Helsinki, Finland

    Simon Puglisi

  3. University College London, London, United Kingdom

    Emine Yilmaz

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Baier, U., Beller, T., Ohlebusch, E. (2015). Parallel Construction of Succinct Representations of Suffix Tree Topologies. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds) String Processing and Information Retrieval. SPIRE 2015. Lecture Notes in Computer Science(), vol 9309. Springer, Cham. https://doi.org/10.1007/978-3-319-23826-5_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23826-5_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23825-8

  • Online ISBN: 978-3-319-23826-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation