Algorithmic Challenges in Complete Genomics and Metagenomics
Computational Genomics Summer Institute CGSI via YouTube
Build with Azure OpenAI, Copilot Studio & Agentic Frameworks — Microsoft Certified
Build the Finance Skills That Lead to Promotions — Not Just Certificates
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore algorithmic challenges in complete genomics and metagenomics through this 46-minute conference talk by Pavel Pevzner at the Computational Genomics Summer Institute. Delve into cutting-edge computational approaches for genome assembly, focusing on multiplex de Bruijn graphs that enable assembly from long, high-fidelity reads and repeat graph methodologies for handling long, error-prone sequencing data. Learn about the latest developments in algorithmic solutions that address the complexities of complete genome reconstruction and metagenomic analysis, drawing from recent breakthrough research in Nature Biotechnology on advanced assembly techniques for next-generation sequencing technologies.
Syllabus
Pavel Pevzner | Algorithmic challenges in complete genomics and metagenomics | CGSI 2025
Taught by
Computational Genomics Summer Institute CGSI