The following pages link to The “Runs” Theorem (Q5359492):
Displayed 50 items.
- A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771) (← links)
- An abelian periodicity lemma (Q507407) (← links)
- Fast computation of abelian runs (Q507408) (← links)
- Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- Clusters of repetition roots: single chains (Q831839) (← links)
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings (Q832954) (← links)
- Computing runs on a general alphabet (Q903195) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets (Q1702853) (← links)
- On the number of gapped repeats with arbitrary gap (Q1708025) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- String covering with optimal covers (Q1757464) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order (Q2043023) (← links)
- Clusters of repetition roots forming prefix chains (Q2112177) (← links)
- On closed-rich words (Q2117106) (← links)
- Factorizing strings into repetitions (Q2135631) (← links)
- Multidimensional period recovery (Q2144266) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Can formal languages help pangenomics to represent and analyze multiple genomes? (Q2163974) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Square network on a word (Q2243587) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Two-dimensional maximal repetitions (Q2297850) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- On the size of the smallest alphabet for Lyndon trees (Q2326391) (← links)
- More properties of the Fibonacci word on an infinite alphabet (Q2330118) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- Prefix frequency of lost positions (Q2358696) (← links)
- Longest previous overlapping factor array (Q2656356) (← links)
- Linear construction of a left Lyndon tree (Q2672265) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- (Q5009559) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- (Q5088889) (← links)
- Computing runs on a trie (Q5088914) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- Computing the Antiperiod(s) of a String (Q5088925) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
- (Q5140264) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- Detecting One-Variable Patterns (Q5150937) (← links)
- (Q5874500) (← links)