bisec-tree
bisec-tree copied to clipboard
Bisector tree implementation in OCaml
With the regulat functor: only exact distances are used. If the user knows a cheap to compute upper bound, we could exploit that one as often as possible. Inspired by:...
now this makes a lot of sense with the add method having been added (to grow an existing tree)
algorithm: - build tree for a smallish random partition - address in parallel all remaining molecules - emboss the small tree - Eventually, continue building the tree for each group...
To try finding a counter example to the triangular inequality when you have doubts about the distance function