The following pages link to (Q2723969):
Displaying 15 items.
- Efficient seed computation revisited (Q390905) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Efficient detection of quasiperiodicities in strings (Q688155) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Finding Gale strings (Q2861535) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- String Periods in the Order-Preserving Model (Q3304137) (← links)
- (Q4367783) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- String Covering: A Survey (Q6145625) (← links)
- Approximation and fixed parameter algorithms for the approximate cover problem (Q6545414) (← links)