Skip to main content
SpringerLink
Log in

Recent Advances of Palindromic Factorization

  • Conference paper
  • First Online:
Book cover Combinatorial Algorithms (IWOCA 2017)

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

Included in the following conference series:

  • 661 Accesses

Abstract

This paper provides an overview of six particular problems of palindromic factorization and recent algorithmic improvements in solving them.

M. Alzamel—Fully supported by the Saudi Ministry of Higher Education and partially supported by the Onassis Foundation.

C.S. Iliopoulos—Partially supported by the Onassis Foundation.

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. Adamczyk, M., Alzamel, M., Charalampopoulos, P., Iliopoulos, C.S., Radoszewski, J.: Palindromic decompositions with gaps and errors. arXiv preprint arXiv:1703.08931 (2017)

    Chapter  Google Scholar 

  2. Alatabbi, A., Iliopoulos, C.S., Rahman, M.S.: Maximal palindromic factorization. In: Proceedings of Prague Stringology Conference 2013, pp. 70–77. Czech Technical University, Prague (2013)

    Google Scholar 

  3. Alzamel, M., Gao, J., Iliopoulos, C.S., Liu, C., Pissis, S.P.: Efficient computation of palindromes in sequences with uncertainties. In: Accepted at Mining Humanistic Data Workshop (2017)

    Google Scholar 

  4. Barton, C., Kociumaka, T., Liu, C., Pissis, S.P., Radoszewski, J.: Indexing weighted sequences: neat and efficient. CoRR, abs/1704.07625 (2017)

    Google Scholar 

  5. Fici, G., Gagie, T., Kärkkäinen, J., Kempa, D.: A subquadratic algorithm for minimum palindromic factorization. J. Discret. Algorithms 28(C), 41–48 (2014)

    Article  MathSciNet  Google Scholar 

  6. Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Mai Alzamel & Costas S. Iliopoulos

  2. King Saud University, Riyadh, Kingdom of Saudi Arabia

    Mai Alzamel

Authors
  1. Mai Alzamel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Costas S. Iliopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mai Alzamel .

Editor information

Editors and Affiliations

  1. University of Newcastle Australia, Callaghan, New South Wales, Australia

    Ljiljana Brankovic

  2. University of Newcastle Australia, Callaghan, New South Wales, Australia

    Joe Ryan

  3. McMaster University, Hamilton, Ontario, Canada

    William F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Alzamel, M., Iliopoulos, C.S. (2018). Recent Advances of Palindromic Factorization. In: Brankovic, L., Ryan, J., Smyth, W. (eds) Combinatorial Algorithms. IWOCA 2017. Lecture Notes in Computer Science(), vol 10765. Springer, Cham. https://doi.org/10.1007/978-3-319-78825-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-78825-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-78824-1

  • Online ISBN: 978-3-319-78825-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation