Library which contains several time-dependent data and index structures (e.g., IntervalTree, BucketTimeSeries), as well as algorithms.

Interval Tree implementation in Java

Kotlin implementation of the abstand library

Useful NGS utilities for everyday use in the form of stand-alone tool.

Data structure for efficiently finding overlapping intervals

RedBlackTree and IntervalTree implements

Interval trees.

Java implementation of basic and advanced data structures.

Command-driven Task Management System in Java with custom B-Tree (id), Interval Tree (conflict detection), and Implicit Segment Tree (range sum). Supports atomic insert/update/delete and deterministic PrintTrees.