Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Sublinear Algorithms for Gap Edit Distance

IEEE via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the concept of gap edit distance and its sublinear algorithms in this 21-minute IEEE conference talk. Delve into the topic with speakers Elazar Goldenberg, Robert Krauthgamer, and Barna Saha as they cover key aspects such as dynamic programming, approximation techniques, and sublinear time complexity. Learn about distance results, compare simple and linear algorithms, and understand the challenges associated with possible matching shifts and period shifts. Gain insights into the keylemmata and main theorem that underpin this fascinating area of computational theory.

Syllabus

Introduction
Definition
Example
Dynamic Programming
Approximation
Sublinear Time
Distance
Results
Comparison
Simple Algorithm
Linear Algorithm
Possible Matching Shift
Period Shift
Keylemma
Challenges
Main Theorem

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of Sublinear Algorithms for Gap Edit Distance

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.