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

0.1

Download files

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

Source Distribution

murphy-0.1.zip (26.1 kB view details)

Uploaded Source

File details

Details for the file murphy-0.1.zip.

File metadata

  • Download URL: murphy-0.1.zip
  • Upload date:
  • Size: 26.1 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No

File hashes

Hashes for murphy-0.1.zip
Algorithm Hash digest
SHA256 9c90d6b178dcda8bafb29274519d7eeb25246f0c0a5ce1c9795491929b34866a
MD5 298a2f4755888b1b7951a79a6281be4c
BLAKE2b-256 d5f9ae5647da04660c01d8d4d1b758cbe8a1936e92f0cd3dd9813851eaf83fe0

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page