Edit Distance in Near-Linear Time - It’s a Constant Factor

Explore a groundbreaking approach to computing edit distance in near-linear time through this 26-minute IEEE conference talk by Columbia University researchers Alexandr Andoni and Negev Shekel Nosatzki. Delve into the problem setup, potential solutions, and the innovative approach that achieves this computational feat. Gain insights into the underlying data structure and its guarantees, understanding why this method works and its implications for algorithmic efficiency.

Introduction
Problem set up
What can be done
Approach
Why
Solution
Data Structure
Guarantees