Hunting Redundancies in Strings

  • Golnaz Badkobeh
  • Supaporn Chairungsee
  • Maxime Crochemore
Conference paper

DOI: 10.1007/978-3-642-22321-1_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)
Cite this paper as:
Badkobeh G., Chairungsee S., Crochemore M. (2011) Hunting Redundancies in Strings. In: Mauri G., Leporati A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg

Abstract

The notion of redundancies in texts, regarded as sequences of symbols, appear under various concepts in the literature of Combinatorics on words and of Algorithms on strings: repetitions, repeats, runs, covers, seeds, and palindromes, for example.

We explore some of the newest aspects of these redundancies.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Golnaz Badkobeh
    • 1
  • Supaporn Chairungsee
    • 1
  • Maxime Crochemore
    • 1
    • 2
  1. 1.King’s College LondonLondonUnited Kingdom
  2. 2.Université Paris-EstFrance

Personalised recommendations