Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 22, 2018, 02:00 pm

Duration: 45 minutes

Location: CAB G 15.2

Speaker: Rozhon Vaclav

Approximating edit distance

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login