| Algorithm 6: Intersects |
| Input: k-mer[i], k-mer[j] Output: intersects BEGIN intersects <- FALSE if k-mer[i].first <= k-mer[j].first AND k-mer[i].last < k-mer[j].last then intersects <- TRUE END |
| Algorithm 6: Intersects |
| Input: k-mer[i], k-mer[j] Output: intersects BEGIN intersects <- FALSE if k-mer[i].first <= k-mer[j].first AND k-mer[i].last < k-mer[j].last then intersects <- TRUE END |