Pages that link to "Item:Q2345877"

The following pages link to Longest common substrings with \(k\) mismatches (Q2345877):

Displaying 11 items.

• A new distributed alignment-free approach to compare whole proteomes (Q1676313) (← links)
• \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
• Efficient computation of sequence mappability (Q2134748) (← links)
• Dynamic and internal longest common substring (Q2211363) (← links)
• A note on the longest common substring with \(k\)-mismatches problem (Q2345875) (← 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)