https://github.com/alexpreynolds/disjoint-windows

Build a list of high-scoring, non-overlapping intervals using sampling or scheduling methods
https://github.com/alexpreynolds/disjoint-windows

bedops bioinformatics disjoint genome packing priority-queue sample scheduling-algorithms

Last synced: about 21 hours ago
JSON representation

Build a list of high-scoring, non-overlapping intervals using sampling or scheduling methods

• Host: GitHub
• URL: https://github.com/alexpreynolds/disjoint-windows
• Owner: alexpreynolds
• Created: 2021-05-10T22:54:46.000Z (over 3 years ago)
• Default Branch: main
• Last Pushed: 2022-02-17T17:54:15.000Z (over 2 years ago)
• Last Synced: 2023-08-06T10:50:59.518Z (over 1 year ago)
• Topics: bedops, bioinformatics, disjoint, genome, packing, priority-queue, sample, scheduling-algorithms
• Language: Python
• Homepage:
• Size: 46.1 MB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0

Awesome Lists containing this project