ReadChop: a high-performance demultiplexer for long-read sequencing data

Clicks: 3
ID: 318687
2026
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #584 of 835 articles by views in BMC Bioinformatics

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 835 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
SUMMARY: Long-read sequencing (LRS) platforms offer extended read lengths but present computational challenges due to high error rates and frequent insertion-deletion (indel) artifacts. While sample multiplexing is essential for cost-efficiency, existing demultiplexing solutions face a dichotomy: vendor-provided tools (e.g., Dorado) often lack the structural flexibility required for highly non-canonical designs, while open-source tools (e.g., Cutadapt) often lack the speed or algorithmic robustness to handle custom, high-complexity barcode designs. Here, we present ReadChop, a high-performance demultiplexer implemented in Rust. ReadChop leverages Myers' bit-parallel algorithm to efficiently model indel-rich error profiles and employs a streaming architecture to ensure low memory footprint. Benchmarking demonstrates that ReadChop achieves classification precision exceeding 99.99% on both simulated datasets-even under ultra-high multiplexing conditions (e.g., 13,824-plex)-and empirical SARS-CoV-2 amplicons. Furthermore, it excels in filtering in silico chimeras (0.1% miss rate) and exhibits linear computational scalability on ultra-long templates (up to 100 kb). Crucially, it significantly accelerates execution speeds-being >6 times faster than Dorado, >2 times faster than Nanoplexer, and >30 times faster than Cutadapt-with memory usage consistently below 200 MB. ReadChop provides a flexible, robust solution for processing massive LRS datasets with non-canonical experimental designs. AVAILABILITY AND IMPLEMENTATION: Source code and documentation are freely available under the MIT license at https://github.com/cherryamme/ReadChop. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Reference Key
openalex_W7165878696 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Chen Jiang, Yuanyan Xiong
Journal BMC Bioinformatics
Year 2026
DOI
10.1093/bioinformatics/btag339
URL
https://doi.org/10.1093/bioinformatics/btag339
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.