Pages that link to "Item:Q5140788"
From MaRDI portal
The following pages link to Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788):
Displaying 5 items.
- Efficient computation of sequence mappability (Q2134748) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
