Bioinformatics AlgorithmsAn Active Learning Approach

Lessons in this chapter

  1. 3.1Exploding NewspapersWhat Is Genome Assembly? The Exploding Newspaper Problem
  2. 3.2The String Reconstruction ProblemThe String Reconstruction Problem and k-mer Composition
  3. 3.3String Reconstruction as a Walk in the Overlap GraphThe Overlap Graph and Hamiltonian Paths in Genome Assembly
  4. 3.4Another Graph for String ReconstructionDe Bruijn Graphs for Genome Assembly
  5. 3.5Walking in the de Bruijn GraphWalking in the de Bruijn Graph: Eulerian Paths and k-mer Composition
  6. 3.6The Seven Bridges of KönigsbergThe Seven Bridges of Königsberg and the Eulerian Cycle Problem
  7. 3.7Euler's TheoremEuler's Theorem for Eulerian Cycles in Directed Graphs
  8. 3.8From Euler's Theorem to an Algorithm for Finding Eulerian CyclesAn Algorithm for Finding Eulerian Cycles and Paths
  9. 3.9Assembling Genomes from Read-PairsAssembling Genomes from Read-Pairs: Paired de Bruijn Graphs
  10. EpilogueGenome Assembly Faces Real Sequencing DataGenome Assembly with Real Sequencing Data: Contigs and Read Errors
Solve the code challengesEvery problem in this chapter, autograded, in the interactive text Lecture videosThe full Chapter 3 playlist

Stuck on something? See the Chapter 3 learner FAQ.