can we fit david's analytical work on error bounds in this paper?

dib-lab / 2020-paper-sourmash-gather

Here we describe an extension of MinHash that permits accurate compositional analysis of metagenomes with low memory and disk requirements.

https://dib-lab.github.io/2020-paper-sourmash-gather

Other

8 stars 1 forks source link

can we fit david's analytical work on error bounds in this paper? #10

Closed ctb closed 3 years ago

ctb commented 3 years ago

current outline would need to be updated to account for this.

who writes it up?

and, if so, maybe a tradeoff --

we might have to deprecate/shorten/remove the stuff on large databases.

ctb commented 3 years ago

trying this out in #12. the greyhound stuff (https://github.com/dib-lab/sourmash/issues/1226) makes me think that we're going to be doing fast database search in a variety of ways and that databases don't really fit in this paper, b/c it's an implementation detail.

ctb commented 3 years ago

upon considered reflection, I agree with me, as does @luizirber. :)

ctb commented 3 years ago

(as in, yes, we will put this in; see #13)