Lecture 19 Longest Common Subsequences

About this video

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

This lecture explains the longest common subsequence problem, a dynamic programming application. It teaches sequence comparison algorithms used in bioinformatics.

A 59-minute video from nptelhrd: “Lecture 19 Longest Common Subsequences”.

Video by nptelhrd, played through YouTube's embedded player.

Part of Computer - Design and Analysis of Algorithms