A Python implementation of the interval binning scheme
Project description
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).
Usage
See the documentation.
Installation
To install the latest release via PyPI using pip:
pip install interval-binning
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
File details
Details for the file interval-binning-1.0.0.tar.gz.
File metadata
- Download URL: interval-binning-1.0.0.tar.gz
- Upload date:
- Size: 4.8 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | e77b748ecce3dde53c744b873f4accfe3f27061357091c68c903f5d86e914b46 |
|
| MD5 | 02117913533c9f5104da88d56d86f69a |
|
| BLAKE2b-256 | 0d6a46e4b08485af84fc997534744fb8b4e433e7cd341204e1043903171cd3e1 |
