Skip to main content
SpringerLink
Log in

Navigating Forest Straight-Line Programs in Constant Time

  • Conference paper
  • First Online:
String Processing and Information Retrieval (SPIRE 2020)

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

Included in the following conference series:

  • 397 Accesses

Abstract

We present a data structure of linear size that allows to perform navigation steps and subtree equality checks in grammar-compressed forests in constant time. Navigation steps include going to the parent, to the left/right neighbor or to the first/last child.

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 EPUB and 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

References

  1. Bille, P., Gørtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inf. Comput. 243, 166–177 (2015). https://doi.org/10.1016/j.ic.2014.12.012

    Article  MathSciNet  MATH  Google Scholar 

  2. Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513–539 (2015). https://doi.org/10.1137/130936889

    Article  MathSciNet  MATH  Google Scholar 

  3. Bojanczyk, M., Walukiewicz, I.: Forest algebras. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games, vol. 2, pp. 107–132. Amsterdam University Press (2008)

    Google Scholar 

  4. Boneva, I., Niehren, J., Sakho, M.: Regular matching and inclusion on compressed tree patterns with context variables. In: Martín-Vide, C., Okhotin, A., Shapira, D. (eds.) LATA 2019. LNCS, vol. 11417, pp. 343–355. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-13435-8_25

    Chapter  MATH  Google Scholar 

  5. Cai, J., Paige, R.: Using multiset discrimination to solve language processing problems without hashing. Theor. Comput. Sci. 145(1&2), 189–228 (1995). https://doi.org/10.1016/0304-3975(94)00183-J

    Article  MathSciNet  MATH  Google Scholar 

  6. Ganardi, M., Jez, A., Lohrey, M.: Balancing straight-line programs. In: Zuckerman, D. (ed.) 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, 9–12 November 2019, pp. 1169–1183. IEEE Computer Society (2019). https://doi.org/10.1109/FOCS.2019.00073

  7. Gascón, A., Lohrey, M., Maneth, S., Reh, C.P., Sieber, K.: Grammar-based compression of unranked trees. In: Fomin, F.V., Podolskii, V.V. (eds.) CSR 2018. LNCS, vol. 10846, pp. 118–131. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-90530-3_11

    Chapter  Google Scholar 

  8. Gasieniec, L., Kolpakov, R.M., Potapov, I., Sant, P.: Real-time traversal in grammar-based compressed files. In: 2005 Data Compression Conference (DCC 2005), Snowbird, UT, USA, 29–31 March 2005, p. 458. IEEE Computer Society (2005). https://doi.org/10.1109/DCC.2005.78

  9. Hucke, D., Lohrey, M., Reh, C.P.: The smallest grammar problem revisited. In: Inenaga, S., Sadakane, K., Sakai, T. (eds.) SPIRE 2016. LNCS, vol. 9954, pp. 35–49. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46049-9_4

    Chapter  Google Scholar 

  10. Jez, A.: Faster fully compressed pattern matching by recompression. ACM Trans. Algorithms 11(3), 20:1–20:43 (2015). https://doi.org/10.1145/2631920

    Article  MathSciNet  MATH  Google Scholar 

  11. Lohrey, M.: Grammar-based tree compression. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 46–57. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21500-6_3

    Chapter  Google Scholar 

  12. Lohrey, M., Maneth, S., Reh, C.P.: Constant-time tree traversal and subtree equality check for grammar-compressed trees. Algorithmica 80(7), 2082–2105 (2018). https://doi.org/10.1007/s00453-017-0331-3

    Article  MathSciNet  MATH  Google Scholar 

  13. Maneth, S., Peternek, F.: Constant delay traversal of compressed graphs. In: Bilgin, A., Marcellin, M.W., Serra-Sagristà, J., Storer, J.A. (eds.) 2018 Data Compression Conference, DCC 2018, Snowbird, UT, USA, 27–30 March 2018, pp. 32–41. IEEE (2018). https://doi.org/10.1109/DCC.2018.00011

  14. Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T., Hashimoto, K.: Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. 410(8–10), 900–913 (2009). https://doi.org/10.1016/j.tcs.2008.12.016

    Article  MathSciNet  MATH  Google Scholar 

  15. Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253–1262 (1988). https://doi.org/10.1137/0217079

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universitt Siegen, Siegen, Germany

    Carl Philipp Reh & Kurt Sieber

Authors
  1. Carl Philipp Reh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kurt Sieber
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carl Philipp Reh .

Editor information

Editors and Affiliations

  1. CISE Department, University of Florida, Gainesville, FL, USA

    Christina Boucher

  2. Department of Computer Science, University of Central Florida, Orlando, FL, USA

    Sharma V. Thankachan

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Reh, C.P., Sieber, K. (2020). Navigating Forest Straight-Line Programs in Constant Time. In: Boucher, C., Thankachan, S.V. (eds) String Processing and Information Retrieval. SPIRE 2020. Lecture Notes in Computer Science(), vol 12303. Springer, Cham. https://doi.org/10.1007/978-3-030-59212-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-59212-7_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-59211-0

  • Online ISBN: 978-3-030-59212-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation