Unfortunately, the Idury–Waterman approach, although very promising, did not scale up well. The problem is that sequencing errors transform a simple de Bruijn graph (corresponding to an error-free SBH ...

A Eulerian path is a path in a graph that passes through all of its edges exactly once. A Eulerian cycle is a Eulerian path that is a cycle. The problem is to find the Eulerian path in an undirected ...

In 1736, Leonhard Euler showed that there was no way to travel across the Seven Bridges of Königsberg, crossing each bridge a single time and ending up where you started. He did this by showing that ...