YoVDO

Approximating Text-to-Pattern Hamming Distances

Offered By: Association for Computing Machinery (ACM) via YouTube

Tags

Algorithms Courses

Course Description

Overview

Explore efficient algorithms for approximating Hamming distances between text and pattern strings in this 21-minute conference talk. Gain insights into previous approaches, understand the intuition behind new techniques, and delve into structured and combined sampling methods. Learn how these advanced algorithms can significantly improve performance in pattern matching and string comparison tasks.

Syllabus

Introduction
Previous algorithms
Intuition
Structured Sampling
Combined Sampling
Conclusion


Taught by

Association for Computing Machinery (ACM)

Related Courses

Information Theory
The Chinese University of Hong Kong via Coursera
Intro to Computer Science
University of Virginia via Udacity
Analytic Combinatorics, Part I
Princeton University via Coursera
Algorithms, Part I
Princeton University via Coursera
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera