Skip to main content
SpringerLink
Log in

On Prefix/Suffix-Square Free Words

  • Conference paper
  • First Online:
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

We present a series of algorithms identifying efficiently the factors of a word that neither start nor end with squares (called, accordingly, prefix-suffix-square free factors). A series of closely related algorithmic problems are discussed.

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. García-López, J., Manea, F., Mitrana, V.: Prefix-suffix duplication. J. Comput. Syst. Sci. 80, 1254–1265 (2014)

    Article  MATH  Google Scholar 

  2. Chan, S., Blackburn, E.: Telomeres and telomerase. Philos. Trans. R. Soc. Lond. B. Biol. Sci. 359, 109–121 (2004)

    Article  Google Scholar 

  3. Preston, R.: Telomeres, telomerase and chromosome stability. Radiat. Res. 147, 529–534 (1997)

    Article  Google Scholar 

  4. Murnane, J.: Telomere dysfunction and chromosome instability. Mutat. Res. 730, 28–36 (2012)

    Article  Google Scholar 

  5. Lothaire, M.: Combinatorics on Words. Cambridge University Press (1997)

    Google Scholar 

  6. Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)

    Book  MATH  Google Scholar 

  7. Xu, Z.: A Minimal Periods Algorithm with Applications. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 51–62. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Gawrychowski, P., Manea, F., Nowotka, D.: Testing generalised freeness of words. In: Proc. STACS 2014. LIPIcs, vol. 25, pp. 337–349 (2014)

    Google Scholar 

  9. Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: Proc. STOC, pp. 246–251 (1983)

    Google Scholar 

  10. Main, M.G.: Detecting leftmost maximal periodicities. Discrete Appl. Math. 25, 145–153 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proc. FOCS, pp. 596–604 (1999)

    Google Scholar 

  12. Duval, J.-P., Kolpakov, R., Kucherov, G., Lecroq, T., Lefebvre, A.: Linear-Time Computation of Local Periods. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 388–397. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53, 918–936 (2006)

    Article  MathSciNet  Google Scholar 

  14. Crochemore, M., Iliopoulos, C.S., Kubica, M., Rytter, W., Waleń, T.: Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 296–307. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G., Panario, D., Viola, A., (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88–94. Springer, Heidelberg (2000)

    Google Scholar 

  16. Bentley, J.: Decomposable searching problems. Inform. Proc. Letters 8, 244–251 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  17. Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inform. Proc. Letters 12, 244–250 (1981)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, RO-010014, Bucharest, Romania

    Marius Dumitran

  2. Department of Computer Science, Christian-Albrechts University of Kiel, Christian-Albrechts-Platz 4, 24118, Kiel, Germany

    Florin Manea & Dirk Nowotka

Authors
  1. Marius Dumitran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florin Manea
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dirk Nowotka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Florin Manea .

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

Dumitran, M., Manea, F., Nowotka, D. (2015). On Prefix/Suffix-Square Free Words. 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_6

Download citation

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

  • 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