RapidNJ 2.3.2

:: DESCRIPTION

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.

::DEVELOPER

RapidNJ team

:: SCREENSHOTS

N/A

:: REQUIREMENTS

• Linux/MacOsX

:: DOWNLOAD

 RapidNJ

:: MORE INFORMATION

Citation:

Martin Simonsen, Thomas Mailund and Christian N. S. Pedersen.
Rapid Neighbour Joining.
In Proceedings of the 8th Workshop in Algorithms in Bioinformatics (WABI), LNBI 5251, 113-122, Springer Verlag, October 2008. doi:10.1007/978-3-540-87361-7_10