Approximating Edit Distance in the Fully Dynamic Model

Explore a lecture on approximating edit distance in the fully dynamic model, presented by Barna Saha from UC San Diego at the Simons Institute. Delve into the fundamental computer science problem of computing edit distance between two strings, and discover recent advancements in designing faster approximation algorithms. Learn about the challenges and progress in computing edit distance in dynamic settings where strings can change over time. Gain insights into the latest research results, joint work with Tomasz Kociumaka and Anish Mukherjee, and consider open questions in this field. This 50-minute talk, part of the Dynamic Graphs and Algorithm Design series, offers a comprehensive look at the state-of-the-art approaches to this critical computational problem.