YoVDO

Sublinear Time Algorithms for Estimating Edit Distance

Offered By: Simons Institute via YouTube

Tags

Sublinear Algorithms Courses Information Theory Courses Randomized Algorithms Courses Computational Complexity Courses Dynamic programming Courses Approximation Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a comprehensive lecture on sublinear time algorithms for estimating edit distance, presented by Barna Saha from UC San Diego as part of the Sublinear Algorithms Boot Camp at the Simons Institute. Delve into advanced computational techniques that aim to efficiently approximate the edit distance between strings in less than linear time. Gain insights into the latest research and methodologies in this crucial area of computer science, which has applications in bioinformatics, natural language processing, and data analysis. Over the course of 68 minutes, examine the theoretical foundations, practical implementations, and potential future directions of these innovative algorithms.

Syllabus

Sublinear Time Algorithms for Estimating Edit Distance


Taught by

Simons Institute

Related Courses

Automata Theory
Stanford University via edX
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera
How to Win Coding Competitions: Secrets of Champions
ITMO University via edX
Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera