Pages that link to "Item:Q1583539"
From MaRDI portal
The following pages link to Repetitive perhaps, but certainly not boring (Q1583539):
Displaying 12 items.
- On the structure of run-maximal strings (Q414413) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Approximate cover of strings (Q2326399) (← links)
- The number of runs in a string (Q2381507) (← links)
- Can we recover the cover? (Q2415365) (← links)
- A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences (Q4792964) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Quasi-Periodicity Under Mismatch Errors (Q5140765) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- String Covering: A Survey (Q6145625) (← links)
