Learn · Introduction to Algorithms and Analysis
Lecture 37 of 60Week 8
Lecture 37: Longest common subsequence
Prof. Sourav Mukhopadhyay · IIT Kharagpur
Credits and licence
- From
- Introduction to Algorithms and Analysis, IIT Kharagpur (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lecture 1: Insertion sort
- Lecture 2: Analysis of Insertion Sort
- Lecture 3: Asymptotic Notation
- Lecture 4: Recurrence for Merge Sort
- Lecture 5: Substitution Method
- Lecture 6: The Master Method
- Lecture 7: Divide-and-Conquer
- Lecture 8: Divide-and-Conquer (Contd..)
- Lecture 9: Straseen's Algorithms
- Lecture 10: QuickSort
- Lecture 11: Analysis of Quicksort.
- Lecture 12: Randomized Quicksort
- Lecture 13: Heap
- Lecture 14: Heap Sort
- Lecture 15: Decision Tree
- Lecture 16: Linear time Sorting
- Lecture 17: Radix Sort & Bucket Sort
- Lecture 18: Order Statistics
- Lecture 19: Order Statistics (Contd.)
- Lecture 20: Worst case linear time order statistics
- Lecture 21 : Hash Function
- Lecture 22 : Open Addressing
- Lecture 23 : Universal Hashing
- Lecture 24 : Perfect Hashing
- Lecture 25 : Binary Search Tree (BST) Sort
- Lecture 26: Randomly build BST
- Lecture 27: Red Black Tree
- Lecture 28: Red Black Tree (Cont...)
- Lecture 29: Augmentation of data structure
- Lecture 30: Interval trees
- Lecture 31 : Fixed Universe Successor
- Lecture 32 : Van Emde Boas data structure
- Lecture 33: Amortized Analysis
- Lecture 34: Computational Geometry
- Lecture 35: Computational Geometry (cont....)
- Lecture 36: Dynamic Programming
- Lecture 37: Longest common subsequence
- Lecture 38: Graphs
- Lecture 39: Prim's Algorithms
- Lecture 40: Graph Search
- Lecture 41: BFS & DFS
- Lecture 42: Shortest path problem
- Lecture 43: Dijktra's
- Lecture 44:Example of Dijktra
- Lecture 45: Bellman Ford
- Lecture 46: Correctness of Bellman Ford
- Lecture 47: Application of Bellman Ford
- Lecture 48: All pairs shortest path
- Lecture 49: Floyd-Warshall
- Lecture 50: Johnson Algorithm
- Lecture 51 : Disjoint set data structure
- Lecture 52 : Union-Find
- Lecture 53 : Augmented disjoint set data structure
- Lecture 54 : Network flow
- Lecture 55 : Network Flow (cont...)
- Lecture 56 : Network Flow (cont...)
- Lecture 57 : More on Dynamic Programming
- Lecture 58 : More on Dynamic Programming (cont...)
- Lecture 59 : Computational Complexity
- Lecture 60 : Computational Complexity (cont...)