Implementation of binary interval search algorithm
This package provides an implementation of the BITS (Binary Interval Search) algorithm, an approach to interval set intersection. It is especially suited for the comparison of diverse genomic datasets and the exploration of large datasets of genome intervals (e.g. genes, sequence alignments).
| Linter | Message | Location |
|---|---|---|
| No lint warnings ✓ | ||