Skip to main content
Conference Proceedings

Hunting redundancies in strings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6795 LNCS 1-14
DOI: 10.1007/978-3-642-22321-1_1
7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Badkobeh, G., Chairungsee, S., & Crochemore, M. (2011). Hunting redundancies in strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 1–14). https://doi.org/10.1007/978-3-642-22321-1_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free