Assembling genomes: Paired De Bruijn Graphs
Explore how paired De Bruijn graphs are constructed and used in genome assembly from (k, d)-mers. Understand the role of prefix and suffix nodes, path graphs, and Eulerian paths in reconstructing genomes. This lesson helps you grasp why not every Eulerian path yields a correct assembly and prepares you to solve related bioinformatics problems.
Given a (k, d)-mer (a . . . a | b, . . . b), we define its prefix and suffix as the following (k −1, d + 1)-mers:
Prefix((a …a |b,…b)) = (a ...