Aug 1, 2019 · We introduce a new and efficient approach, called the containment MinHash approach, that is more suitable for estimating the Jaccard index of sets of very ...

MinHash is a probabilistic method for estimating the similarity of two sets in terms of their Jaccard index, defined as the ratio of the size of their ...

Aug 1, 2019 · To demonstrate the practical utility of the containment MinHash technique, we consider an application in the area of metagenomics (the study of ...

Sep 4, 2017 · We introduce a new and efficient approach, called the containment min hash approach, that is more suitable for estimating the Jaccard index of sets of very ...

We introduce a new and efficient approach, called the containment MinHash approach, that is more suitable for estimating the Jaccard index of sets of very ...

Containment min hash is a method that combines min hash and bloom filters that allows the Jaccard index (similarity of two sets defined as the cardinality ...

Aug 1, 2019 · Koslicki, David, and Zabeti, Hooman. Improving MinHash via the containment index with applications to metagenomic analysis. Retrieved from https ...

Nov 5, 2019 · We describe an online algorithm capable of measuring the containment of genomes and proteomes within either assembled or unassembled sequencing read sets.

Sep 21, 2023 · The main index we consider is the max-containment index, which corresponds to ; minimizing the denominator maximizes the containment. These ...

sourmash: a library for MinHash sketching of DNA., Brown and Irber, 2017. Improving MinHash via the Containment Index with Applications to Metagenomic Analysis.