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.
- On the approximation ratio of LZ-end to LZ77 (Q2146133) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Squares and primitivity in partial words (Q2341712) (← links)
- Approximate periodicity (Q2343134) (← 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)
- On left and right seeds of a string (Q2376787) (← links)
- The number of runs in a string (Q2381507) (← links)
- Computing the \(\lambda \)-covers of a string (Q2384518) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- Closest periodic vectors in \(L_p\) spaces (Q2446104) (← links)
- Constructing suffix arrays in linear time (Q2569391) (← links)
- Optimal discovery of repetitions in 2D (Q2573235) (← links)
- On shuffled-square-free words (Q2680851) (← links)
- Polynomial time multiplication and normal forms in free bands (Q2693634) (← links)
- ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS (Q2909197) (← links)
- Computing Primitively-Rooted Squares and Runs in Partial Words (Q2946044) (← links)
- Longest $$\alpha $$-Gapped Repeat and Palindrome (Q2947867) (← links)
- On Prefix/Suffix-Square Free Words (Q2949834) (← links)
- Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties (Q2974059) (← links)
- Polynomial-Time Approximation Algorithms for Weighted LCS Problem (Q3011875) (← links)
- (Q3332275) (← links)
- ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS (Q3434282) (← links)
- Optimal Parallel Searching an Array for Certain Repetitions (Q3438903) (← links)
- Repetitions detection on a linear array with reconfigurable pipelined bus system (Q3439858) (← links)
- Towards a Solution to the “Runs” Conjecture (Q3506961) (← links)
- Bounds on Powers in Strings (Q3533012) (← links)
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS (Q3586403) (← links)
- AVERAGE VALUE OF SUM OF EXPONENTS OF RUNS IN A STRING (Q3655541) (← links)
- Un réseau linéaire pour la reconnaissance des mots sans carré (Q3789096) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Detecting the morphic images of a word : improving the general algorithm (Q4348237) (← links)
- Algorithms For Computing Approximate Repetitions In Musical Sequences (Q4780537) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- ZIV-LEMPEL AND CROCHEMORE FACTORIZATIONS OF THE GENERALIZED PERIOD-DOUBLING WORD (Q5075611) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Efficient solving of the word equations in one variable (Q5096891) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
- On the Prefix–Suffix Duplication Reduction (Q5217116) (← links)
- Generalized approximate regularities in strings (Q5451457) (← links)
- WORD COMPLEXITY AND REPETITIONS IN WORDS (Q5696964) (← links)
- (Q5874500) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- Approximate periods of strings (Q5958136) (← links)
- Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q5967094) (← links)
- String Covering: A Survey (Q6145625) (← links)
- (Q6150948) (← links)