Rosalind Problem Solving in Python: Episode 8 - Graphs and Genome Assembly 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 8, we look at graph problems and begin looking into genome assembly.
00:00 Start screen
06:34 Welcome!
12:20 LONG: Genome Assembly as Shortest Superstring
48:07 CORR: Error Corrections in Reads
1:22:24 TREE: Completing a Tree
1:37:11 INOD: Counting Phylogenetic Ancestors
1:53:02 PDST: Creating a Distance Matrix
2:05:27 Looking ahead 🫶
Starter code link: https://shorturl.at/8wPJK
Completed code link: https://shorturl.at/9EWQ8
Problems covered:
🧬 Genome Assembly as Shortest Superstring: https://rosalind.info/problems/long/
🧬 Error Corrections in Reads: https://rosalind.info/problems/corr/
🧬 Completing a Tree: https://rosalind.info/problems/tree/
🧬 Counting Phylogenetic Ancestors: https://rosalind.info/problems/inod/
🧬 Creating a Distance Matrix: https://rosalind.info/problems/pdst/
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:
/ discord
⸻
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://philomathlearning.com
Membership supports the instructors and helps keep Philomath open.
In questa pagina del sito puoi guardare il video online Rosalind Problem Solving in Python: Episode 8 - Graphs and Genome Assembly I della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Philomath 01 gennaio 1970, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 426 volte e gli è piaciuto 21 spettatori. Buona visione!
