Open Source
Benchmarking Traditional and Learning-Based Reference-Free Compressors for Long-Read Sequencing Data
arXiv math.IT0 views
arXiv:2611.23794v1 Announce Type: new Abstract: Long-read sequencing technologies generate large volumes of data, creating substantial storage and transmission demands. Although reference-based compressors can achieve high compression, their reliance on an appropriate reference genome limits their use. We present LRCBench, a benchmark and survey of reference-free lossless compressors for long-read sequencing data. We review traditional and learning-based general-purpose and sequencing-specific methods, then evaluate 35 compressors on 16 real-world datasets from Oxford Nanopore and PacBio platforms. We compare compression ratio, storage savings, runtime, peak memory use, and robustness across datasets. Learning-based compressors are evaluated on six MinION datasets because of their high computational costs. CoLoRd achieves the best overall compression ratios in our experiments, while other methods offer trade-offs in speed, memory use, and robustness. We also examine multithreaded speedup and discuss future directions in parallel acceleration, privacy protection, adaptive parameter tuning, and hardware-algorithm co-design.
Source:https://arxiv.org/abs/2611.23794PreviousThe Geometry of Mode Sampling in Reconfigurable MIMO Channel ExtrapolationNextSFiD: Self-Supervised Fitness-Driven Optimization for Next-Generation Networking
Related posts
Muscle-memory – repeated Claude Code tasks run with zero tokens
0Hacker News New
The End of Continuous Rework
0Hacker News Ask
Multilayer printed circuit boards made from paper
0Phys.org Tech
LLVM Effectively Completes Its Relicensing After Nearly A Decade Of Work
0Phoronix
UPDF 3.0: One PDF Workflow from OCR and Editing to eSign
0FOSS Bytes
Revenant XSpark Signs Pranav Venkatesh as Its First Chess Player for Google Play Arena
0FOSS Bytes