streammd: fast low-memory duplicate marking using a Bloom filter
Abstract
SummaryThe identification of duplicate reads is an essential pre-processing step in short-read sequencing analysis. For large sequencing libraries this step is typically time-consuming and resource-intensive. Here we present streammd: a fast, memory-efficient, single-pass duplicate marking tool operating on the principle of a Bloom filter. We show that streammd closely reproduces the outputs of Picard MarkDuplicates, a widely-used duplicate marking program, while being substantially faster and suitable for pipelined applications, and that it requires much less memory than SAMBLASTER, another single-pass duplicate marking tool. Availability and Implementationstreammd is a C++ program available from GitHub (https://github.com/delocalizer/streammd) under the MIT license. Install instructions are in the README.md file. Unit tests are runnable with make check. Open issues are listed at https://github.com/delocalizer/streammd/issues. Contactconrad.leonard@qimrberghofer.eu.au Supplementary informationSupplemenatary_figures.zip Supplementary_tables.zip
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 8
- FWCI
- 0.71
- Field percentile
- top 37%
- Assay
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- FastDedup - A fast and memory-efficient tool for read deduplication
Raphaël Ribes, Celine MANDIER, Alice Baniel·bioRxiv·May 4, 2026
- Algorithms for efficiently collapsing reads with Unique Molecular Identifiers
Daniel Liu·PeerJPeer-reviewed·Dec 16, 2019
- BamHash: a checksum program for verifying the integrity of sequence data
Arna Óskarsdóttir, Gísli Másson, Páll Melsted·BioinformaticsPeer-reviewed·Sep 10, 2015
- BLEND: A Fast, Memory-Efficient, and Accurate Mechanism to Find Fuzzy Seed Matches in Genome Analysis
Can Fırtına, Jisung Park, … Onur Mutlu·NAR Genomics and BioinformaticsPeer-reviewed·Jan 10, 2023
- Back to sequences: find the origin of kmers
Anthony Baire, Pierre Marijon, … Pierre Peterlongo·The Journal of Open Source SoftwarePeer-reviewed·Sep 23, 2024
- Super Bloom: Fast and precise filter for streaming k-mer queries
Etienne Conchon-Kerjan, Timothé Rouzé, … Antoine Limasset·Journal of Computational BiologyPeer-reviewed·Oct 7, 2026