Pages that link to "Item:Q1401359"
From MaRDI portal
The following pages link to Finding approximate repetitions under Hamming distance. (Q1401359):
Displaying 13 items.
- A matching algorithm in PMWL based on CluTree (Q265007) (← links)
- On the complexity of finding gapped motifs (Q972352) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- Multidimensional period recovery (Q2144266) (← links)
- Approximate cover of strings (Q2326399) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- Can we recover the cover? (Q2415365) (← links)
- Speeding up the detection of tandem repeats over the edit distance (Q2437752) (← links)
- Most pseudo-copy languages are not context-free (Q2695285) (← links)
- AVOIDING APPROXIMATE SQUARES (Q3538854) (← links)
- Quasi-Periodicity Under Mismatch Errors (Q5140765) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
