Session 6A - Approximating Text-to-Pattern Hamming Distances

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Addresses approximating text-to-pattern Hamming distances, a string algorithm problem with applications in pattern matching. Presents algorithmic techniques for sequence analysis.

A 21-minute video from Association for Computing Machinery (ACM): “Session 6A - Approximating Text-to-Pattern Hamming Distances”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020