Skip to content

martijnvermaat/interval-binning

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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).

Usage

See the documentation.

Installation

To install the latest release via PyPI using pip:

pip install interval-binning

About

A Python implementation of the interval binning scheme

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages