Skip to main content
SpringerLink
Log in

Cadences in Grammar-Compressed Strings

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2021)

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

  • 306 Accesses

Abstract

Cadences are structurally maximal arithmetic progressions of indices corresponding to equal characters in an underlying string.

This paper provides a detection algorithm for 3-cadences in binary strings which runs in linear time on uncompressed strings and in polynomial time on grammar-compressed strings.

Furthermore, this paper proves that several variants of the cadence detection problem are \(\mathcal {NP}\)-complete on grammar-compressed strings and that the equidistant subsequence matching problem with patterns of length three is \(\mathcal {NP}\)-complete on grammar-compressed ternary strings.

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. Amir, A., Apostolico, A., Gagie, T., Landau, G.M.: String cadences. Theor. Comput. Sci. 698, 4–8 (2017). https://doi.org/10.1016/j.tcs.2017.04.019

  2. Charikar, M., et al.: The smallest grammar problem. IEEE Trans. Inf. Theor. 51(7), 2554–2576 (2005). https://doi.org/10.1109/TIT.2005.850116

    Article  MathSciNet  MATH  Google Scholar 

  3. Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M., Shinohara, A.: Detecting k-(Sub-)cadences and equidistant subsequence occurrences. In: Gørtz, I.L., Weimann, O. (eds.) 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 161, pp. 12:1–12:11. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2020). https://doi.org/10.4230/LIPIcs.CPM.2020.12

  4. Funakoshi, M., Pape-Lange, J.: Non-rectangular convolutions and (Sub-)cadences with three elements. In: Paul, C., Bläser, M. (eds.) 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 154, pp. 30:1–30:16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2020). https://doi.org/10.4230/LIPIcs.STACS.2020.30

  5. Gardelle, J.: Cadences. Mathématiques et Sci. Humaines 9, 31–38 (1964). http://www.numdam.org/item/MSH_1964__9__31_0

  6. Jeż, A.: Faster fully compressed pattern matching by recompression. ACM Transactions on Algorithms 11(3), Jan 2015. https://doi.org/10.1145/2631920

  7. Kempa, D., Kociumaka, T.: Resolution of the burrows-wheeler transform conjecture. CoRR abs/1910.10631. Accepted to the 61st Annual Symposium Foundations of Computer Science (FOCS 2020) (2019). http://arxiv.org/abs/1910.10631

  8. Lohrey, M.: Algorithms on compressed words. The Compressed Word Problem for Groups. SM, pp. 43–65. Springer, New York (2014). https://doi.org/10.1007/978-1-4939-0748-9_3

    Chapter  MATH  Google Scholar 

  9. Lothaire, M.: Combinatorics on Words. Cambridge Mathematical Library, Cambridge University Press, Cambridge (1997). https://doi.org/10.1017/CBO9780511566097

  10. Pape-Lange, J.: On extensions of maximal repeats in compressed strings. In: Gørtz, I.L., Weimann, O. (eds.) 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17–19, 2020, Copenhagen, Denmark. LIPIcs, vol. 161, pp. 27:1–27:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020). https://doi.org/10.4230/LIPIcs.CPM.2020.27

  11. Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1–3), 211–222 (2003). https://doi.org/10.1016/S0304-3975(02)00777-6

    Article  MathSciNet  MATH  Google Scholar 

  12. Beweis einer Baudet’schen Vermutung: Waerden, B.L.v.d. Nieuw Archief voor Wiskunde 15, 212–216 (1927)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Chemnitz, Straße der Nationen 62, 09111, Chemnitz, Germany

    Julian Pape-Lange

Authors
  1. Julian Pape-Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julian Pape-Lange .

Editor information

Editors and Affiliations

  1. University of Milano-Bicocca, Milan, Italy

    Alberto Leporati

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. Ariel University, Ariel, Israel

    Dana Shapira

  4. University of Milano-Bicocca, Milan, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pape-Lange, J. (2021). Cadences in Grammar-Compressed Strings. In: Leporati, A., Martín-Vide, C., Shapira, D., Zandron, C. (eds) Language and Automata Theory and Applications. LATA 2021. Lecture Notes in Computer Science(), vol 12638. Springer, Cham. https://doi.org/10.1007/978-3-030-68195-1_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-68195-1_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-68194-4

  • Online ISBN: 978-3-030-68195-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation