Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, November 22, 2018, 02:00 pm
Duration: 45 minutes
Location: CAB G 15.2
Speaker: Rozhon Vaclav
The edit distance between two strings is a way of quantifying their similarity by counting the minimum number of operations required to transform one string into the other. It can be computed exactly using a dynamic programming algorithm that runs in quadratic time. This is, however, too slow for some applications. In this talk we present the recent randomized algorithm of Chakraborty, Das, Goldenberg, Koucky, and Saks running in time roughly O(n12/7) that approximates the edit distance within a factor of 3.01. So far this is the only known algorithm achieving a constant approximation in truly subquadratic time.
Automatic MiSe System Software Version 1.4803M | admin login