Pages that link to "Item:Q2508342"
From MaRDI portal
The following pages link to The subtree max gap problem with application to parallel string covering (Q2508342):
Displaying 10 items.
- Efficient seed computation revisited (Q390905) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- Algorithms For Computing Approximate Repetitions In Musical Sequences (Q4780537) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Generalized approximate regularities in strings (Q5451457) (← links)
- Approximate periods of strings (Q5958136) (← links)
- String Covering: A Survey (Q6145625) (← links)