I was reading a paper named "Comparison of the two major classes of assembly algorithms: overlap–layout–consensus and de-bruijn-graph" by Zhenyu Li et al. (2011), when I came across the following sentence:
I thought that the minimum overlap between two reads should be no less than K-1 and not K. I would really appreciate it if someone could explain me the quoted statement.
In the DBG algorithm, to ensure the k-mers can be linked, the minimum overlap between two reads should be no less than the k-mer size K that is equivalent to the T parameter in the Lander–Waterman model.
Comment