Pages that link to "Item:Q1894296"
From MaRDI portal
The following pages link to Squares, cubes, and time-space efficient string searching (Q1894296):
Displaying 50 items.
- Square-free words with one possible mismatch (Q297663) (← links)
- The new periodicity lemma revisited (Q313759) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- Lyndon words and Fibonacci numbers (Q392802) (← links)
- The three squares lemma revisited (Q414439) (← links)
- The three-squares lemma for partial words with one hole (Q418740) (← links)
- How many double squares can a string contain? (Q476303) (← links)
- On a lemma of Crochemore and Rytter (Q491147) (← links)
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
- Space efficient search for maximal repetitions (Q557913) (← links)
- Distinct squares in run-length encoded strings (Q606988) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- On primary and secondary repetitions in words (Q764340) (← links)
- Clusters of repetition roots: single chains (Q831839) (← links)
- Maximal repetitions in strings (Q931723) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Intersecting periodic words (Q1022587) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- How many squares can a string contain? (Q1268630) (← links)
- Periodicity and the golden ratio (Q1275466) (← links)
- The exact number of squares in Fibonacci words (Q1292484) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- On the number of gapped repeats with arbitrary gap (Q1708025) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Partial words and the critical factorization theorem (Q1770435) (← links)
- Existence of words over three-letter alphabet not containing squares with replacement errors (Q1791616) (← links)
- On maximal suffixes and constant-space linear-time versions of KMP algorithm. (Q1874422) (← links)
- Data structures and algorithms for the string statistics problem (Q1913702) (← links)
- Clusters of repetition roots forming prefix chains (Q2112177) (← links)
- Factorizing strings into repetitions (Q2135631) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Square network on a word (Q2243587) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Two-dimensional maximal repetitions (Q2297850) (← links)
- Existence of words over a binary alphabet free from squares with mismatches (Q2332806) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- A note on the number of squares in a word (Q2373759) (← links)
- More results on overlapping squares (Q2376782) (← links)
- Prefix-suffix duplication (Q2453545) (← links)
- Partial words and the critical factorization theorem revisited (Q2456370) (← links)
- Periods in extensions of words (Q2509152) (← links)
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares (Q2568974) (← links)
- A multidimensional critical factorization theorem (Q2581347) (← links)
- On the number of \(k\)-powers in a finite word (Q2672960) (← links)
- Asymptotic behaviour of the maximal number of squares in standard Sturmian words (Q2909197) (← links)
- Large-scale detection of repetitions (Q2955637) (← links)
