Combinatorics of Periods in Strings

Authors:
Eric Rivals;Sven Rahmann
Affiliations:
-;-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 2
Cited 1

Text algorithms

Text algorithms
Combinatorics of words

Handbook of formal languages, vol. 1

Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the set Γ(n) of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducible period set. We prove that Γ(n) is a lattice under set inclusion and does not satisfy the Jordan-Dedekind condition.We propose the first enumeration algorithm for Γ(n) and improve upon the previously known asymptotic lower bounds on the cardinality of Γ(n). Finally, we provide a new recurrence to compute the number of strings sharing a given period set.