Sublinear Time Algorithms for Estimating Edit Distance
Offered By: Simons Institute via YouTube
Course Description
Overview
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
Algorithms: Design and Analysis, Part 2Stanford University via Coursera Discrete Optimization
University of Melbourne via Coursera Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Computability, Complexity & Algorithms
Georgia Institute of Technology via Udacity Discrete Inference and Learning in Artificial Vision
École Centrale Paris via Coursera