NCLS. Basically a static interval-tree that is silly fast for both construction and lookups. Deprecated but maintained.
-
Updated
Jul 4, 2025 - C
#
interval-tree
Here are 7 public repositories matching this topic...
The esa-matchfinder is a C99 library for efficient Lempel-Ziv factorization using enhanced suffix array (ESA).
-
Updated
Sep 2, 2025 - C
Augmented Interval Tree implemented in Cython/C
-
Updated
Jan 17, 2025 - C
Data Structures and Algorithms
c avl-tree queue algorithms datastructures graph-algorithms bit sorting-algorithms heap interval-tree trees stacks segment-tree union-find advanced-data-structures
-
Updated
Jan 30, 2021 - C
An interval tree library interpretation based on augmented AVL balanced binary trees.
-
Updated
Apr 26, 2018 - C
A python library for constructing interval trees with associated exon/annotation information
-
Updated
Aug 7, 2019 - C
hashing avl-tree linked-list stack queue dfs binary-search-tree interval-tree bfs bst dijkstra-algorithm doubly-linked-list floyd-warshall-algorithm
-
Updated
Mar 14, 2021 - C
Improve this page
Add a description, image, and links to the interval-tree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the interval-tree topic, visit your repo's landing page and select "manage topics."