Pages that link to "Item:Q1761494"
From MaRDI portal
The following pages link to Computing regularities in strings: a survey (Q1761494):
Displaying 21 items.
- Enhanced string covering (Q393116) (← links)
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914) (← links)
- Fast computation of abelian runs (Q507408) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Quasiperiodicity and string covering (Q1292493) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Foreword: Algorithms, strings and theoretical approaches in the big data era -- special issue in honor of the 60th birthday of Professor Raffaele Giancarlo (Q1676298) (← links)
- String cadences (Q1676299) (← links)
- Partial words with a unique position starting a square (Q1730024) (← links)
- The wide window string matching algorithm (Q1770398) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- On approximate enhanced covers under Hamming distance (Q2295626) (← links)
- Prefix frequency of lost positions (Q2358696) (← links)
- The number of runs in a string (Q2381507) (← links)
- Algorithms on strings. Translated from the 2001 French original (Q2925476) (← links)
- (Q3114378) (← links)
- (Q4599213) (← links)
- (Q5310979) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- String Covering: A Survey (Q6145625) (← links)
