Assembling genomes: Paired De Bruijn Graphs

Given a (k, d)-mer (a$_{1}$ . . . a$_{k}$ | b$_{1}$, . . . b$_{k}$), we define its prefix and suffix as the following (k −1, d + 1)-mers:

Prefix((a$_{1}$ …a$_{k}$ |b$_{1}$ ...