Skip to main content
SpringerLink
Log in

Periods and Quasiperiods Characterization

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1848))

Included in the following conference series:

  • 581 Accesses

Abstract

We provide a new characterization of periods and quasiperi ods that is constructive. It allows for a canonical partition of the set of borders of a given word w. Each subset of the partition contains a superprimitive border q and possibly quasiperiodic borders that admit qas a cover. Notably, we characterize superprimitive borders. A few enumeration results are given.

This research was supported by ESPRIT LTR Project No. 20244 (ALCOM IT)

This research was partially supported by ABISS and C.N.R.S. Program “Génomes”

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. A. Apostolico and A. Ehrenfeucht. Efficient detection of quasiperiodicities in strings. Theoretical Computer Science, 119(2):247–265, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. Apostolico, M. Farach and C. S. Iliopoulos. Optimal superprimitivity testing for strings. Information Processing Letters, 39(1):17–20, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Breslauer. An on-line string superprimitivity test. Information Processing Letters, 44(6):345–347, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  4. L. Guibas and A.M. Odlyzko. String Overlaps, Pattern Matching and Nontransitive Games. Journal of Combinatorial Theory, Series A, 30:183–208, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  5. C.S. Iliopoulos and L. Mouchard. Quasiperiodicity: from detection to normal forms. Journal of Automata, Languages and Combinatorics, 4(3):213–228, 1999.

    MATH  MathSciNet  Google Scholar 

  6. C. S. Iliopoulos and L. Mouchard. An o(n logn) algorithm for computing all maximal quasiperiodicities in strings. In C. S. Calude and M. J. Dinneen, editors, Combinatorics, Computation and Logic. Proceedings of DMTCS’99 and CATS’99, Lecture Notes in Computer Science, pages 262–272, Auckland, New-Zealand, 1999.

    Google Scholar 

  7. C.S. Iliopoulos and L. Mouchard. Quasiperiodicity and string covering. Theoretical Computer Science, 218(1):205–216, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  8. Lothaire. Combinatorics on Words. Addison-Wesley, Reading, Mass., 1983.

    MATH  Google Scholar 

  9. F. Mignosi and A. Restivo. Periodicity (Chapter 9). Algebraic Combinatorics on Words. to appear; preliminary version at http://www-igm.univ-mlv.fr/~berstel/Lothaire/2000.

  10. M. Régnier. Enumeration of bordered words. RAIRO Theoretical Informatics and Applications, 26,4:303–317, 1992.

    Google Scholar 

  11. M. Régnier. A Unified Approach to Word Occurrences Probabilities. Discrete Applied Mathematics, 1999. to appear; preliminary version at RECOMB’98.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Domaine de Voluceau, INRI A Rocquencourt, B.P. 105, 78153, Le Chesnay Cedex, France

    Mireille Régnier

  2. ESA 6037 - ABISS, Université de Rouen, 76821, Mont-Saint-Aignan Cedex, France

    Laurent Mouchard

  3. Dept. of Sci, King’s College London, Strand, WC2R 2LS, London, UK

    Laurent Mouchard

Authors
  1. Mireille Régnier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent Mouchard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica ed Applicazioni, Universitá die Palermo, Via Archirafi 34, 90123, Palermo, Italy

    Raffaele Giancarlo

  2. Centre de recherches mathématiques, Université de Montréal, CP 6128, succursale Centre-Ville, Montréal, Québec, Canada, H3C 3J7

    David Sankoff

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Régnier, M., Mouchard, L. (2000). Periods and Quasiperiods Characterization. In: Giancarlo, R., Sankoff, D. (eds) Combinatorial Pattern Matching. CPM 2000. Lecture Notes in Computer Science, vol 1848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45123-4_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-45123-4_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67633-1

  • Online ISBN: 978-3-540-45123-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation