Rosalind Problem Solving in Python: Episode 6 - Alignment I

Join Phillip Compeau, Carnegie Mellon professor and Rosalind co-founder, for a Python live problem-solving session on Rosalind — a platform for learning bioinformatics through coding. In Episode 6, we begin exploring sequence alignment. 00:00 Start screen 05:17 Welcome! 08:02 Idea 1: Alignments are paths in a network 15:52 Idea 2: Dynamic programming helps us find a longest path 24:17 LCSQ: https://rosalind.info/problems/lcsq/ 1:05:51 LGIS: https://rosalind.info/problems/lgis/ 1:18:50 EDIT: https://rosalind.info/problems/edit/ 1:34:51 EDTA: https://rosalind.info/problems/edta/ 2:00:45 SCSP: https://rosalind.info/problems/scsp/ 2:18:51 Looking ahead to more dynamic programming 🫶 Problems covered: 🧬 Finding a Shared Spliced Motif: https://rosalind.info/problems/lcsq/ 🧬 Longest Increasing Subsequence: https://rosalind.info/problems/lgis/ 🧬 Edit Distance: https://rosalind.info/problems/edit/ 🧬 Edit Distance Alignment: https://rosalind.info/problems/edta/ 🧬 Interleaving Two Motifs: https://rosalind.info/problems/scsp/ Starter code link: https://shorturl.at/8wPJK Completed code link: https://shorturl.at/9EWQ8 New episodes stream Thursdays at 11:00 AM ET. Follow along, solve with us, and sharpen your bioinformatics problem-solving skills. ▶ Sign up for our Philomath mailing list to receive course materials, reminders, and earn a certificate: http://eepurl.com/iC9DSg ▶ Link to Rosalind: https://rosalind.info ▶ Join the Philomath community on Discord: https://discord.gg/n5ZKySCKU4 ⸻ Philomath Membership All lectures and recordings are free and open. If you’d like to participate more deeply—through office hours, bonus sessions, and community support—you can become a Philomath member here: https://philomath.memberful.com Membership supports the instructors and helps keep Philomath open.