Implement canonical neighbor-joining through algorithm.
RapidNJ is an algorithmic engineered implementation of canonical neighbor-joining. It uses an efficient search heuristic to speed-up the core computations of the neighbor-joining method that enables RapidNJ to outperform other state-of-the-art neighbor-joining implementations. It includes an efficient computation of distance estimators from input alignments.