Daniel Baker

Following up on this, I've changed the behavior to compute a [cardinality estimate of 0](https://github.com/dnbaker/sketch/commit/d64e78495d5a328c659f2ea10c62f3574dc881e1) for an empty sketch, and incorporated this into the [dev branch](https://github.com/dnbaker/sketch/tree/dev). Does this help solve...

Hi, Thanks for the feedback! You're right that recursive submodules can take a long time, which is something we're looking to improve without making dependency management too difficult. Good to...

Fixed as of https://github.com/dnbaker/dashing/commit/22e340a2f428582b9e49f2570834f34ec205d193. (Emits intersection size instead of union size.)

Hi Mihkel, Thanks for reporting. I made a mistake making this change. It's been patched, both in [master at this commit](26506bdc195c21c70f6d3212f09f57c98eee186e) and [v0.4.5](https://github.com/dnbaker/dashing/releases/tag/v0.4.5). Would you give it another try for...

Thanks for the find, I'll investigate this soon. You're right that it'd be a big tricky to have -T report intersections along the diagonal, but checking out the off-diagonal entries...

I'm closing this for now, but feel free to open if you have any further issues.

I see. I can add this sometime relatively soon. I would guess that the bloom filter would overestimate. I'm not sure if there's any way to arrive at cardinality estimates...

This is rather interesting, as for the paper our end result for measuring Jaccard Index accuracy, whereas the mash distance is a log transform downstream. Some of the issue could...

It’d be useful and worth consideration. Which encoding scheme(s) to support and doing so efficiently (IE, comparably to our nucleic acid support) wouldn’t necessarily be trivial, but we’ve looked into...

Hi, Thanks both for the bug report and making it easy to reproduce. We'll get this looked into and patched up in the next day or so. Best, Daniel