Lightweight assembly algorithm designed to be executed on a desktop machine. It uses a pair of cache oblivious Bloom filters, one holding a uniform sample of g-spaced sequenced k-mers and the other holding k-mers classified as likely correct, using a simple statistical test.
| Label | Latest Version |
|---|---|
| main | 1.0 |
| cf201901 | 1.0 |
