Graph matching and edit distance algorithms form a cornerstone of modern computational techniques used to quantify the similarity between structured data. These methods underpin a wide array of ...

At the upcoming ACM Symposium on Theory of Computing, MIT researchers are expected to report that the Wagner-Fischer algorithm cannot be improved upon because it’s as good and efficient as it gets.