Pages that link to "Item:Q1155963"
From MaRDI portal
The following pages link to An optimal algorithm for computing the repetitions in a word (Q1155963):
Displaying 50 items.
- Improved linear systolic algorithms for substring statistics (Q287010) (← links)
- The three squares lemma revisited (Q414439) (← links)
- \(k\)-abelian pattern matching (Q491150) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Average number of occurrences of repetitions in a necklace (Q496552) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Efficient detection of quasiperiodicities in strings (Q688155) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- On the number of frames in binary words (Q719267) (← links)
- On primary and secondary repetitions in words (Q764340) (← links)
- A coarse-grained multicomputer algorithm for the detection of repetitions (Q835058) (← links)
- A fast algorithm for finding the positions of all squares in a run-length encoded string (Q837185) (← links)
- An efficient algorithm for online square detection (Q860815) (← links)
- Maximal repetitions in strings (Q931723) (← links)
- How many runs can a string contain? (Q935160) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Sequences generated by infinitely iterated morphisms (Q1070044) (← links)
- Structural properties of the string statistics problem (Q1076522) (← links)
- Optimal off-line detection of repetitions in a string (Q1170893) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- How many squares can a string contain? (Q1268630) (← links)
- The exact number of squares in Fibonacci words (Q1292484) (← links)
- Quasiperiodicity and string covering (Q1292493) (← links)
- An optimal algorithm to compute all the covers of a string (Q1329417) (← links)
- A characterization of the squares in a Fibonacci string (Q1392029) (← links)
- Weak repetitions in Sturmian strings. (Q1401224) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- Fibonacci arrays and their two-dimensional repetitions (Q1566729) (← links)
- Repetitions in Sturmian strings (Q1583533) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- On the number of gapped repeats with arbitrary gap (Q1708025) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← links)
- Computing regularities in strings: a survey (Q1761494) (← 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)
- Detecting leftmost maximal periodicities (Q1825029) (← links)
- A linear time lower bound on McCreight and general updating algorithms for suffix trees (Q1879368) (← links)
- Speeding up the detection of evolutive tandem repeats (Q1884977) (← links)
- Detecting morphic images of a word: On the rank of a pattern (Q1899100) (← links)
- Covering a string (Q1924404) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- Multidimensional period recovery (Q2144266) (← links)
