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 compute lower bounds on superstring lengths. #68

Closed OndrejSladky closed 2 weeks ago

OndrejSladky commented 7 months ago

I accidentally merged the previous PR.

PavelVesely commented 6 months ago

Quick question: does the global greedy algorithm tweaked for computing the lower bound also use the memory optimization trick? @OndrejSladky

OndrejSladky commented 6 months ago

Quick question: does the global greedy algorithm tweaked for computing the lower bound also use the memory optimization trick? @OndrejSladky

It does.