An overlap graph is a directed graph in which each string in a collection
is represented by a node and node $s$ is connected to $t$ with a directed edge
if some suffix of $s$ equals a prefix of $t$.
We assume that the two substrings are longer than some predetermined threshold $k$ to prevent
noise in the graph.
