Hunting Redundancies in Strings
- 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
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.
Unable to display preview. Download preview PDF.