Pages that link to "Item:Q2384518"
From MaRDI portal
The following pages link to Computing the \(\lambda \)-covers of a string (Q2384518):
Displaying 8 items.
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Generalized approximate regularities in strings (Q5451457) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- String Covering: A Survey (Q6145625) (← links)
