Pages that link to "Item:Q5369556"
From MaRDI portal
The following pages link to Longest Common Substring with Approximately k Mismatches (Q5369556):
Displaying 8 items.
- A new distributed alignment-free approach to compare whole proteomes (Q1676313) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. (Q5140774) (← links)
- Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
- Longest Common Factor After One Edit Operation (Q5150915) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
