Fast approximate string matching
Software—Practice & Experience
Approximate string-matching with q-grams and maximal matches
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Text algorithms
Theory and application of Marsaglia's monkey test for pseudorandom number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
A comparison of approximate string matching algorithms
Software—Practice & Experience
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Handbook of formal languages, vol. 1
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
q-gram based database searching using a suffix array (QUASAR)
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
On the Distribution of the Number of Missing Words in Random Texts
Combinatorics, Probability and Computing
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Combinatorics on partial word correlations
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
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 efficient 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, and exhibit an algorithm to sample uniformly period sets through irreducible period set.