The Longest Common Subsequence (LCS) is one of the most basic similarity measures and it captures important applications in bioinformatics and text analysis. Following the SETHbased nearly-quadratic time lower bounds for LCS from recent years [4, 22, 5, 3], it is a major open problem to understand the complexity of approximate LCS. In the last ITCS [2] drew… (More)