Skip to main content

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.

Project details

Release history Release notifications | RSS feed

This version


Download files

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

Source Distribution (26.1 kB view hashes)

Uploaded source

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring Facebook / Instagram Facebook / Instagram PSF Sponsor Fastly Fastly CDN Google Google Object Storage and Download Analytics Huawei Huawei PSF Sponsor Microsoft Microsoft PSF Sponsor NVIDIA NVIDIA PSF Sponsor Pingdom Pingdom Monitoring Salesforce Salesforce PSF Sponsor Sentry Sentry Error logging StatusPage StatusPage Status page