Skip to main content
This is a pre-production deployment of Warehouse. Changes made here affect the production instance of PyPI (
Help us improve Python packaging - Donate today!

Generic tools to identify overlapping genomic regions

Project Description

The intervalTree class is an adaptation of the interval tree algorithm based on red-black trees from Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein (2001) 2nd Edition, The MIT Press

This makes a nice self-balancing tree. The alrogithm may be more efficient if items are randomly selected for insertion, instead of in sort order.

I’ve modified the CLRS algorithm to report all overlapping nodes instead of only the first node. This involved adding a min value instead of only a max value in order to speed up the search by checking if the subtree min,max overlaps with the search interval. The search routine is also recursive.

Release History

This version
History Node


Download Files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Filename, Size & Hash SHA256 Hash Help File Type Python Version Upload Date
(26.1 kB) Copy SHA256 Hash SHA256
Source None Jul 16, 2017

Supported By

Elastic Elastic Search Pingdom Pingdom Monitoring Dyn Dyn DNS Sentry Sentry Error Logging CloudAMQP CloudAMQP RabbitMQ Kabu Creative Kabu Creative UX & Design Fastly Fastly CDN DigiCert DigiCert EV Certificate Google Google Cloud Servers