Longest Common Substring with Approximately k Mismatches


In the longest common substring problem we are given two strings of length n and must find a substring of maximal length that occurs in both strings. It is well-known that the problem can be solved in linear time, but the solution is not robust and can vary greatly when the input strings are changed even by one letter. To circumvent this, Leimeister and… (More)
DOI: 10.4230/LIPIcs.CPM.2016.21


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.