An ultra-fast all-in-one FASTQ preprocessor (QC/adapters/trimming/filtering/splitting/merging...)
-
Updated
Jul 5, 2025 - C++
An ultra-fast all-in-one FASTQ preprocessor (QC/adapters/trimming/filtering/splitting/merging...)
A C++ header only interval tree implementation.
unfold+mixed models = unmixed | alpha version!
Code in C++ to create new overlap intervals using heap struct
2D k-d tree implementation for counting points in a region
Add a description, image, and links to the overlap topic page so that developers can more easily learn about it.
To associate your repository with the overlap topic, visit your repo's landing page and select "manage topics."