|
vg
tools for working with variation graphs
|
#include <functional>Namespaces | |
| vg | |
| vg::algorithms | |
Functions | |
| void | vg::algorithms::sample_minimal (size_t count, size_t element_length, size_t window_size, size_t sequence_length, const std::function< size_t(size_t)> &get_start, const std::function< bool(size_t, size_t)> &should_beat, const std::function< void(size_t)> &sample) |
Minimizer (sub)sampling algorithm, as explained in the Winnowmap paper, Jain et al. 2020. Goes through read space and samples all candidates that are minimal in a sliding window of a given size.
1.8.17