Closed OndrejSladky closed 6 months ago
Great, thanks for the update! I'll merge it.
Hence now parallelism makes no sense for single set. We might want to improve upon this in the future, but right now I don't believe it has good work/gain ratio.
THis we will need to base upon benchmarking data I believe. Usually, the slowest part is k-mer hashing. A typical use case where ProphAsm currently fails, is computing simplitigs from thousands of very similar genomes. Here, parallelism should help a lot.
Currently blocked by #9
Done. Also simultaneous removal of intersection and simultaneous assembling.
Hence now parallelism makes no sense for single set. We might want to improve upon this in the future, but right now I don't believe it has good work/gain ratio.