A Python implementation of the interval binning scheme
These are some utility functions for working with the interval binning scheme as used in the UCSC Genome Browser. This scheme can be used to implement fast overlap-based querying of intervals, essentially mimicking an R-tree index.
Note that some database systems natively support spatial index methods such as R-trees. See for example the PostGIS extension for PostgreSQL.
Although in principle the method can be used for binning any kind of intervals, be aware that the largest position supported by this implementation is 2^29 (which covers the longest human chromosome).
See the documentation.
To install the latest release via PyPI using pip:
pip install interval-binning
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size interval-binning-1.0.0.tar.gz (4.8 kB)||File type Source||Python version None||Upload date||Hashes View hashes|