Combinatorics of periods in strings.
From MaRDI portal
Publication:1417950
DOI10.1016/S0097-3165(03)00123-7zbMath1073.68706OpenAlexW2092172944WikidataQ61704585 ScholiaQ61704585MaRDI QIDQ1417950
Publication date: 6 January 2004
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0097-3165(03)00123-7
Related Items (8)
Some indices of alphabet overlap graph ⋮ String matching and 1d lattice gases ⋮ Border correlations, lattices, and the subgraph component polynomial ⋮ Border Correlations, Lattices, and the Subgraph Component Polynomial ⋮ Combinatorics on partial word borders ⋮ Equations on partial words ⋮ Two fast constructions of compact representations of binary words with given set of periods ⋮ Combinatorics on partial word correlations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periods in strings
- Approximate string-matching with \(q\)-grams and maximal matches
- An interruptible algorithm for perfect sampling via Markov chains
- Monkey tests for random number generators
- Accurate estimation of the number of binary partitions
- Algorithms on Strings, Trees and Sequences
- On the Distribution of the Number of Missing Words in Random Texts
- Theory and application of Marsaglia's monkey test for pseudorandom number generators
- Uniqueness Theorems for Periodic Functions
This page was built for publication: Combinatorics of periods in strings.