Introduction to Smith-Waterman – An accurate DNA sequencing algorithm

on YouTube ↗11m

" summary

Smith‑Waterman guarantees optimal local alignment by filling a scoring matrix initialized with zeros, using a substitution matrix plus gap penalties, then tracing back from the single highest cell. Example: aligning tdtc vs dtca yields a maximum score of 3 and local alignment GTC after the traceback. Zeros prevent negative propagation (contrast with Needleman‑Wunsch global alignment). Also shows non‑bio uses: treating network packets or musical notes as sequences for motif discovery or anomaly detection.

AI-written summary · about

" chapters (12)

1. 0:00Introduction
2. 0:11Did you know
3. 1:16Sequence alignment
4. 2:23Global and local alignment
5. 3:09Global pandemic
6. 3:49Algorithm
7. 4:28Motif
8. 5:00Components
9. 5:55Scoring Matrix
10. 6:16Scoring
11. 7:32Example
12. 10:02Conclusion

" related talks

• 01h 20mFundamental Algorithms in Deep Sequencing II: Mapping/AlignmentLior Pachter · Algorithmic Challenges in Genomics Boot Camp
• 31mParallel Biological Sequence Comparison in Large GPU ClustersAlba Cristina Magalhaes Alves de Melo · OpenPOWER Summit NA 2020
• 31mHacking the Human Genome Using Clojure and Similarity SearchArnoldo Jose Muller-Molina · Clojure/conj 2011
• 27mA Statistical, Reference-Free Algorithm Subsumes Myriad Problems in Genome ScienceJulia Salzman · From Algorithms to Discovery in Genome-Scale Biology and Medicine 2022
• 39mDesigning 1000 genomes in a single bound: The Codon DSLAaron Kimball, Theron Rabe · Strange Loop 2017
• 28mNanopore Basecalling for Directed EvolutionIan Holmes · Computational Challenges in Very Large-Scale 'Omics'
• 01h 29mFundamental Algorithms in Deep Sequencing III: Genomic Compression: Storage, Transmission, and ...Noah M. Daniels · Algorithmic Challenges in Genomics Boot Camp
• 53mApplied Functional Programming in Computational GenomicsJamie Dixon · NDC Oslo 2022