Counting overlapping pairs of words
From MaRDI portal
Cites work
- A fast algorithm for the all-pairs suffix-prefix problem
- A New Approach to Cross-Bifix-Free Sets
- A note on bifix-free sequences (Corresp.)
- A simple suboptimal construction of cross-bifix-free codes
- A strong non-overlapping Dyck code
- Algorithms on Strings, Trees and Sequences
- An efficient algorithm for the all pairs suffix-prefix problem
- Combinatorics of periods in strings.
- Constructions and bounds for codes with restricted overlaps
- Convergence of the number of period sets in strings
- Convergence of the number of period sets in strings
- DNA, words and models. Statistics of exceptional words. Translated from the 2003 French original
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 1615294 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1754624 (Why is no real title available?)
- Mutual Borders and Overlaps
- On a Conjecture by Eriksson Concerning Overlap in Strings
- On maximal unbordered factors
- On the Distribution of the Number of Missing Words in Random Texts
- On the expected duration of a search for a fixed pattern in random data (Corresp.)
- Periodicity and unbordered segments of words
- Periods and binary words
- Periods and borders of random words
- Periods in strings
- String overlaps, pattern matching, and nontransitive games
- The Ehrenfeucht-Silberger problem
- Theory and application of Marsaglia's monkey test for pseudorandom number generators
This page was built for publication: Counting overlapping pairs of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866514)
