Skip to main content
SpringerLink
Log in

Local Maximal Equality-Free Periodicities

  • Conference paper
  • First Online:
Artificial Intelligence Applications and Innovations. AIAI 2023 IFIP WG 12.5 International Workshops (AIAI 2023)

Part of the book series: IFIP Advances in Information and Communication Technology ((IFIPAICT,volume 677))

  • 521 Accesses

Abstract

In this paper, we study local maximal antiperiodicities. Given a string X and an integer k, we compute the maximal k-antiperiodicity starting at every position of X; that is, we identify a maximum-length sequence of distinct factors, where each is of length k. The space and time complexity of the algorithm is linear.

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 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover 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. Alamro, H., Badkobeh, G., Belazzougui, D., Iliopoulos, C.S., Puglisi, S.J.: Computing the antiperiod (s) of a string. In: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)

    Google Scholar 

  2. Alzamel, M., et al.: Online algorithms on antipowers and antiperiods. In: Brisaboa, N.R., Puglisi, S.J. (eds.) String Processing and Information Retrieval, pp. 175–188. Springer International Publishing, Cham (2019)

    Chapter  Google Scholar 

  3. Badkobeh, G., Fici, G., Puglisi, S.J.: Algorithms for anti-powers in strings. Inf. Process. Lett. 137, 57–60 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bannai, H., et al.: Diverse palindromic factorization is NP-complete. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 85–96. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21500-6_6

    Chapter  Google Scholar 

  5. Bulteau, L., et al.: Multivariate algorithmics for NP-hard string problems. Bulletin of EATCS 3(114) (2014)

    Google Scholar 

  6. Burcroff, A.: \((k,\lambda )\)-anti-powers and other patterns in words. Electron. J. Comb. 25(P4.41) (2018)

    Google Scholar 

  7. Condon, A., Maňuch, J., Thachuk, C.: Complexity of a collision-aware string partition problem and its relation to oligo design for gene synthesis. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 265–275. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-69733-6_27

    Chapter  MATH  Google Scholar 

  8. Condon, A., Maňuch, J., Thachuk, C.: The complexity of string partitioning. J. Discrete Algorithms 32, 24–43 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cox, J.C., Lape, J., Sayed, M.A., Hellinga, H.W.: Protein fabrication automation. Protein Sci. 16(3), 379–390 (2007)

    Article  Google Scholar 

  10. Defant, C.: Anti-power prefixes of the Thue-Morse word. Electron. J. Comb. 24 (2017)

    Google Scholar 

  11. Farach, M.: Optimal suffix tree construction with large alphabets. In: Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on, pp. 137–143. IEEE (1997)

    Google Scholar 

  12. Fici, G., Restivo, A., Silva, M., Zamboni, L.Q.: Anti-powers in infinite words. J. Comb. Theory, Ser. A 157, 109–119 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gaetz, M.: Anti-power \( j \)-fixes of the thue-morse word. Discrete Math. Theoretical Comput. Sci. 23 (2021)

    Google Scholar 

  14. Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.: A linear time algorithm for seeds computation. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete algorithms, pp. 1095–1112. SIAM (2012)

    Google Scholar 

  15. Kociumaka, T., Radoszewski, J., Rytter, W., Straszyński, J., Waleń, T., Zuba, W.: Efficient representation and counting of antipower factors in words. Inf. Comput. 286, 104779 (2022)

    Article  MathSciNet  MATH  Google Scholar 

  16. Stemmer, W.P., Crameri, A., Ha, K.D., Brennan, T.M., Heyneker, H.L.: Single-step assembly of a gene and entire plasmid from large numbers of oligodeoxyribonucleotides. Gene 164(1), 49–53 (1995)

    Article  Google Scholar 

  17. Thue, A.: Uber unendliche zeichenreihen. Norske Vid Selsk. Skr. I Mat-Nat Kl. (Christiana) 7, 1–22 (1906)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, King Saud University, Riyadh, Saudi Arabia

    Mai Alzamel

  2. LITIS, Normandie University, 76000, Rouen, France

    Jacqueline W. Daykin

  3. Department of Information Science, Stellenbosch University, Stellenbosch, South Africa

    Jacqueline W. Daykin

  4. Department of Computer Science, Aberystwyth University, Wales, UK

    Jacqueline W. Daykin

  5. Department of Informatics, King’s College, London, UK

    Christopher Hampson, Costas S. Iliopoulos & Zara Lim

  6. Department of Computing and Software, McMaster University, Hamilton, ON, Canada

    W. F. Smyth

Authors
  1. Mai Alzamel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacqueline W. Daykin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christopher Hampson
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Costas S. Iliopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zara Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. W. F. Smyth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zara Lim .

Editor information

Editors and Affiliations

  1. University of Piraeus, Piraeus, Greece

    Ilias Maglogiannis

  2. Democritus University of Thrace, Xanthi, Greece

    Lazaros Iliadis

  3. Democritus University of Thrace, Xanthi, Greece

    Antonios Papaleonidas

  4. Hellenic Telecom Organization OTE, Athens, Greece

    Ioannis Chochliouros

Rights and permissions

Reprints and permissions

Copyright information

© 2023 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Alzamel, M., Daykin, J.W., Hampson, C., Iliopoulos, C.S., Lim, Z., Smyth, W.F. (2023). Local Maximal Equality-Free Periodicities. In: Maglogiannis, I., Iliadis, L., Papaleonidas, A., Chochliouros, I. (eds) Artificial Intelligence Applications and Innovations. AIAI 2023 IFIP WG 12.5 International Workshops. AIAI 2023. IFIP Advances in Information and Communication Technology, vol 677. Springer, Cham. https://doi.org/10.1007/978-3-031-34171-7_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-34171-7_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-34170-0

  • Online ISBN: 978-3-031-34171-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation