Simulation benchmarks

Possible Simulations
- [ ] Uniform distribution along line (i.e. pH gradient). Can determine if the sorted tree has the same ordering of pH as the original distribution.
- [ ] Number of clusters (variance, mean separation). Can determine if the top level clusters match the original cluster

For each simulation, we will want to investigate
1. Running time
2. Memory usage
3. Parallelizability

No files, tests, or entry points are named. Start by inspecting the repository to find how hierarchical-clustering benchmarks are defined, then determine how to represent the uniform-line and clustered-data simulations and measure running time, memory usage, ordering or cluster agreement, and parallelizability.

Written by the indexing model from the issue text.