A curated collection of classic algorithm implementations with clear structure, covering dynamic programming, greedy, graph, and divide & conquer techniques.

Zhang and his collaborators describe a novel algorithm that can infer the structure of a hypergraph using only the observed dynamics. Their algorithm uses time-series data—observations collected at ...

We were not aware of the details of the results presented there when we devised our structure, which rests mainly though not entirely on published experimental data and stereo-chemical arguments.