search

OndrejSladky / kmercamel

KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.
MIT License
11 stars 2 forks source link

KmerCamel can minimize number of runs of ones. #61

Closed OndrejSladky closed 8 months ago

PavelVesely commented 8 months ago

Thanks! Just curious, what's the memory requirement of optimizing runs compared to greedy (with memory optimization)?

OndrejSladky commented 8 months ago

Thanks! Just curious, what's the memory requirement of optimizing runs compared to greedy (with memory optimization)?

About twice the requirements of global, i.e. 100B/k-mer (for a single genome though). I guess this could still pass even for HG.