The following pages link to Approximate cover of strings (Q2326399):
Displaying 11 items.
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Multidimensional period recovery (Q2144266) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Can we recover the cover? (Q2415365) (← links)
- Inferring strings from cover arrays (Q2846478) (← links)
- Quasi-Periodicity Under Mismatch Errors (Q5140765) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- String Covering: A Survey (Q6145625) (← links)
- Approximating the Anticover of a String (Q6485926) (← links)
- Approximation and fixed parameter algorithms for the approximate cover problem (Q6545414) (← links)