Pages that link to "Item:Q2404618"
From MaRDI portal
The following pages link to Two strings at Hamming distance 1 cannot be both quasiperiodic (Q2404618):
Displaying 7 items.
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Approximate cover of strings (Q2326399) (← 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)
- Density of \(k\)-ary words with 0, 1, 2-error overlaps (Q6652469) (← links)