Aviad Rubinstein

Reducing approximate Longest Common Subsequence to approximate Edit Distance

2019 · Society for Industrial and Applied Mathematics eBooks

Given a pair of n-character strings, the problems of computing their Longest Common Subsequence and Edit Distance have been extensively studied for decades. For exact algorithms, LCS and Edit Distance (with character insertions and deletions) …