LinkedIn

Disjoint Set (Union-Find)

Before diving into Kruskal's Algorithm, I spent some time understanding one of the most important graph data structures: Disjoint Set (Union-Find).
GitHub

An Efficient Multiple-Testing Adjustment for eQTL Studies that Accounts for Linkage Disequilibrium between Variants

eigenMT is a computationally efficient multiple testing correction method for cis-eQTL studies. Typically, modern cis-eQTL studies correct for multiple testing across thousands of variants for a ...
Nature

Deep generative models of protein structure uncover distant relationships across a continuous fold space

Briefly, our method centers a protein domain in a 256 3 Å 3 cubic volume to allow for large domains, and each atom is mapped to a 1 Å 3 voxel using a k D-tree data structure, with a query ball radius ...
GitHub

The Meta-Agent Challenge

What is the Meta-Agent Challenge? The Meta-Agent Challenge (MAC) flips the usual benchmark setup. Instead of asking an AI to solve a task, MAC asks it to build the agent that solves the task — ...
LinkedIn

Data Stream as Disjoint Intervals LeetCode Solution

🧠 Solved LeetCode #90 – Subsets II Continuing my Data Structures and Algorithms practice, I recently solved LeetCode Problem #90 – Subsets II, which focuses on generating all possible subsets while ...