| search | ||
|---|---|---|
|
RapidNJ is an algorithmic engineered implementation of canonical neighbour-joining. It uses an efficient search heuristic to speed-up the core computations of the neighbour-joining method that enables RapidNJ to outperform other state-of-the-art neighbour-joining implementations.
homepage: https://github.com/somme89/rapidNJ
| version | toolchain |
|---|---|
2.3.3 |
GCCcore/11.3.0 |
0 - a - b - c - d - e - f - g - h - i - j - k - l - m - n - o - p - q - r - s - t - u - v - w - x - y - z