The following pages link to Enhanced string covering (Q393116):
Displaying 15 items.
- Computing covers using prefix tables (Q313747) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← links)
- String covering with optimal covers (Q1757464) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- On approximate enhanced covers under Hamming distance (Q2295626) (← links)
- Approximate cover of strings (Q2326399) (← links)
- Can we recover the cover? (Q2415365) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Quasi-Periodicity Under Mismatch Errors (Q5140765) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- String Covering: A Survey (Q6145625) (← links)
