Let:
- K be the set of kmers
- B be the set of barcodes
- E be the set of edges
- R be the set of reads
For each k in K, let e(k) be the edge that contains k
For each bc in B, let K(bc) be the set of kmers that belong to at least 1 read in bc
For each bc, let E(bc) be the set of edges that, for each e in E(bc), exist k in K so that e(k) = e
The goal is to speed up the build local assembly process using E(bc)
Let:
For each k in K, let e(k) be the edge that contains k
For each bc in B, let K(bc) be the set of kmers that belong to at least 1 read in bc
For each bc, let E(bc) be the set of edges that, for each e in E(bc), exist k in K so that e(k) = e
The goal is to speed up the build local assembly process using E(bc)