Pages that link to "Item:Q1825029"
From MaRDI portal
The following pages link to Detecting leftmost maximal periodicities (Q1825029):
Displaying 42 items.
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- On the structure of run-maximal strings (Q414413) (← links)
- The three squares lemma revisited (Q414439) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- Parameterized longest previous factor (Q441845) (← links)
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
- The ``runs'' conjecture (Q544875) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Distinct squares in run-length encoded strings (Q606988) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- A fast algorithm for finding the positions of all squares in a run-length encoded string (Q837185) (← links)
- Computing runs on a general alphabet (Q903195) (← links)
- Maximal repetitions in strings (Q931723) (← links)
- How many runs can a string contain? (Q935160) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295) (← links)
- Two-pattern strings. I: A recognition algorithm (Q1827270) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- Computing longest previous non-overlapping factors (Q1944092) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- More properties of the Fibonacci word on an infinite alphabet (Q2330118) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- More results on overlapping squares (Q2376782) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- Speeding up the detection of tandem repeats over the edit distance (Q2437752) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← links)
- ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS (Q2909197) (← links)
- On Prefix/Suffix-Square Free Words (Q2949834) (← links)
- Large-scale detection of repetitions (Q2955637) (← links)
- Towards a Solution to the “Runs” Conjecture (Q3506961) (← links)
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING (Q3532151) (← links)
- Bounds on Powers in Strings (Q3533012) (← links)
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS (Q3586403) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
- WORD COMPLEXITY AND REPETITIONS IN WORDS (Q5696964) (← links)
