-
Indexlr should be templated on Bloom filter type. Right now it only supports plain Bloom filters.
Counting Bloom filters were implemented already in indexlr by @MurathanGoktas at https://github.com/b…
-
I think Bloom Filters are pretty cool. They are a fairly fast and space-efficient implementation of a set with the trade-off that "False positive matches are possible, but false negatives are not – in…
-
What is the difference between the [select version](https://github.com/FastFilter/fastfilter_java/blob/master/fastfilter/src/main/java/org/fastfilter/bloom/count/SuccinctCountingBlockedBloom.java) and…
-
In current implementation of incremental backup we iterate over pages to find which of them were changed, but for huge databases such process may take several hours. It is not really a problem for man…
-
I have an RNA seq that I need to assemble from PacBio and when I send the script the program do not pass the stage 2. I work with PACbio long read Hifi sequence that end up being all around 12 mil…
A-pcd updated
3 months ago
-
I have used direct RNA-seq ONT long reads data. while running the rnabloom2, I got an error in the assembly step. I am not getting the reason behind it. could you help me out? I have pasted the comma…
-
Since BlobFile is sorted, here is a potential optimization for point lookup:
For each BlobFile, maintain an in-memory bloom filter for keys.
Maintain a global in-memory bloom filter(updatable, count…
-
How fast can we make kmer counting in Rust?
@ctb, are there examples of this from Sourmash or other libraries?
-
Write test cases for the data structure Bloom Filters
-
While the xor filters are what is new and exciting about the contents of this repository, the other filters are good and there are tradeoffs which make them useable. In order to make an accessibly li…