Hunting redundancies in strings

Authors:
Golnaz Badkobeh;Supaporn Chairungsee;Maxime Crochemore
Affiliations:
King's College London, London, United Kingdom;King's College London, London, United Kingdom;King's College London, London, United Kingdom and Université Paris-Est, France
Venue:
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Year:
2011

Citing 29
Cited 0

An O(n log n) algorithm for finding all repetitions in a string

Journal of Algorithms
Transducers and repetitions

Theoretical Computer Science
Text compression

Text compression
Detecting leftmost maximal periodicities

Discrete Applied Mathematics - Combinatorics and complexity
How many squares can a string contain?

Journal of Combinatorial Theory Series A
Of Periods, Quasiperiods, Repetitions and Covers

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Finding Maximal Repetitions in a Word in Linear Time

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Computing all repeats using suffix arrays

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Polynomial versus exponential growth in repetition-free binary words

Journal of Combinatorial Theory Series A
Linear time algorithms for finding and representing all the tandem repeats in a string

Journal of Computer and System Sciences
Avoiding large squares in infinite binary words

Theoretical Computer Science - Combinatorics on words
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
A simple proof that a word of length n has at most 2n distinct squares

Journal of Combinatorial Theory Series A
Algorithms on Strings

Algorithms on Strings
A note on the number of squares in a word

Theoretical Computer Science
The number of runs in a string

Information and Computation
Algorithmic Aspects of Bioinformatics (Natural Computing Series)

Algorithmic Aspects of Bioinformatics (Natural Computing Series)
Computing Longest Previous Factor in linear time and applications

Information Processing Letters
Maximal repetitions in strings

Journal of Computer and System Sciences
How many runs can a string contain?

Theoretical Computer Science
A Simple Algorithm for Computing the Lempel Ziv Factorization

DCC '08 Proceedings of the Data Compression Conference
Fast and Practical Algorithms for Computing All the Runs in a String

CPM '07 Proceedings of the 18th annual symposium on Combinatorial Pattern Matching
Searching for Gapped Palindromes

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Not So Many Runs in Strings

Language and Automata Theory and Applications
LPF Computation Revisited

Combinatorial Algorithms
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
The “runs” conjecture

Theoretical Computer Science
The number of runs in a string: improved analysis of the linear upper bound

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Analysis of maximal repetitions in strings

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.