top of page

Join our interactive text

Get the print book

Share our project

Chapter 3

How do we assemble genomes?

Bioinformatics Algorithms Chapter 3 Cover
Lesson 3.1

Exploding Newspapers

Lesson 3.1

Lesson 3.2

Lesson 3.2

The String Reconstruction Problem

Lesson 3.3

String Reconstruction as a Walk in the Overlap Graph

Lesson 3.3

Lesson 3.4

Another Graph for String Reconstruction

Lesson 3.4

Lesson 3.5

Walking in the de Bruijn Graph

Lesson 3.5

Lesson 3.6

The Seven Bridges of Konigsberg

Lesson 3.6

Lesson 3.7

Euler's Theorem

Lesson 3.7

Lesson 3.8

From Euler's Theorem to an Algorithm for Finding Eulerian Cycles

Lesson 3.8

Lesson 3.9

Assembling Genomes from Read-Pairs

Lesson 3.9

Epilogue

Epilogue: Genome Assembly Faces Real Sequencing Data

Epilogue

bottom of page