Improving MinHash via the containment index with applications to metagenomic analysis

DOI10.1101/184150zbMATH Open1428.68276OpenAlexW2750898971WikidataQ128306501 ScholiaQ128306501MaRDI QIDQ2011091FDOQ2011091

Authors: David Koslicki, Hooman Zabeti 

Publication date: 28 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1101/184150

Recommendations

• MetaCoAG: binning metagenomic contigs via composition, coverage and assembly graphs
• Tailoring r-index for Document Listing Towards Metagenomics Applications
• Fast approximation of frequent \(k\)-mers and applications to metagenomics
• An information and statistical analysis pipeline for microbial metagenomic sequencing data

zbMATH Keywords

containmentmetagenomicsJaccard indexMinHashtaxonomic classification

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Genetics and epigenetics (92D10) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Space/time trade-offs in hash coding with allowable errors
• Probability and Computing
• Scaling metagenome sequence assembly with probabilistic de Bruijn graphs
• Min-wise independent permutations

Cited In (4)

• Efficient reconciliation of genomic datasets of high similarity
• Estimation of three-way similarities based on connected bit Minwise Hash
• Set similarity search beyond MinHash
• The exact probability law for the approximated similarity from the Minhashing method

Uses Software

• HyperLogLog
• Mash
• sourmash
• BioBloom Tools
• BLESS
• GemSIM

This page was built for publication: Improving MinHash via the containment index with applications to metagenomic analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011091)