Pages that link to "Item:Q2414870"
From MaRDI portal
The following pages link to Longest common substring with approximately \(k\) mismatches (Q2414870):
Displaying 8 items.
- Computing the longest common substring with one mismatch (Q764249) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- A note on the longest common substring with \(k\)-mismatches problem (Q2345875) (← links)
- Longest common substrings with \(k\) mismatches (Q2345877) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)