The following pages link to Periods in strings (Q1154284):
Displaying 48 items.
- Two fast constructions of compact representations of binary words with given set of periods (Q507396) (← links)
- Where to place a hole to achieve a maximal escape rate (Q532611) (← links)
- A new method of approximating the probability of matching common words in multiple random sequences (Q607627) (← links)
- Asymptotic number of isometric generalized Fibonacci cubes (Q658005) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- Gray code orders for \(q\)-ary words avoiding a given factor (Q748433) (← links)
- Construction of the weight polynomial for autocorrelation of \(q\)-ary words (Q763559) (← links)
- Testing primitivity on partial words (Q868383) (← links)
- Waiting times for clumps of patterns and for structured motifs in random sequences (Q876489) (← links)
- String matching and 1d lattice gases (Q878347) (← links)
- Combinatorics on partial word borders (Q897922) (← links)
- Two-pattern strings. II: Frequency of occurrence and substring complexity (Q925072) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- Periodicity properties on partial words (Q948072) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- On occurrence of subpattern and method of gambling teams (Q1039834) (← links)
- Cross-monotone subsequences (Q1057271) (← links)
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials (Q1094743) (← links)
- Deviations from uniformity in random strings (Q1099625) (← links)
- String overlaps, pattern matching, and nontransitive games (Q1149796) (← links)
- Algebraic methods for permutations with prescribed patterns (Q1166524) (← links)
- Periodicities on trees (Q1275075) (← links)
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words (Q1292483) (← links)
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach (Q1328400) (← links)
- On pattern occurrences in a random text (Q1351627) (← links)
- A generating function approach to random subgraphs of the \(n\)-cycle (Q1357744) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- Combinatorics of periods in strings. (Q1417950) (← links)
- The first return time test of pseudorandom numbers (Q1612346) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- On cyclic strings avoiding a pattern (Q1744751) (← links)
- Partial words and the critical factorization theorem (Q1770435) (← links)
- An asymptotically optimal layout for the shuffle-exchange graph (Q1838315) (← links)
- Local periods and binary partial words: an algorithm (Q1884922) (← links)
- Asymptotics of Mahler recurrences: The cyclotomic case (Q1919149) (← links)
- 1-dependent stationary sequences for some given joint distributions of two consecutive random variables (Q1930604) (← links)
- Periods and binary words (Q1971621) (← links)
- On the accuracy of statistical procedures in Microsoft Excel 2010 (Q2259776) (← links)
- Partial words and the critical factorization theorem revisited (Q2456370) (← links)
- Primitive partial words (Q2486065) (← links)
- Border Correlations, Lattices, and the Subgraph Component Polynomial (Q2946042) (← links)
- On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
- Compound Poisson approximation of word counts in DNA sequences (Q3127360) (← links)
- On the distribution of characteristic parameters of words (Q4800266) (← links)
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains (Q5488994) (← links)
- Ranking and unranking bordered and unbordered words (Q6121434) (← links)
- Entropy bounds for multi-word perturbations of subshifts (Q6143505) (← links)
- Zero-Order Markov Processes with Multiple Final Sequences of States (Q6185503) (← links)
