The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Calculate RNNI distance between and manipulate with ranked trees. RNNI stands for Ranked Nearest Neighbour Interchange and is an extension of the classical NNI space (space of trees created by the NNI moves) to ranked trees, where internal nodes are ordered according to their heights (usually assumed to be times). The RNNI distance takes the tree topology into account, as standard NNI does, but also penalizes changes in the order of internal nodes, i.e. changes in the order of times of evolutionary events. For more information about the RNNI space see: Gavryushkin et al. (2018) <doi:10.1007/s00285-017-1167-9>, Collienne & Gavryushkin (2021) <doi:10.1007/s00285-021-01567-5>, Collienne et al. (2021) <doi:10.1007/s00285-021-01685-0>, and Collienne (2021) <http://hdl.handle.net/10523/12606>.
Version: | 0.1.1 |
Imports: | methods, ape |
Suggests: | testthat (≥ 3.0.0) |
Published: | 2023-08-25 |
DOI: | 10.32614/CRAN.package.rrnni |
Author: | Jiří C. Moravec [aut, cre], Lena Collienne [aut] |
Maintainer: | Jiří C. Moravec <jiri.c.moravec at gmail.com> |
BugReports: | https://github.com/biods/rrnni/issues |
License: | GPL (≥ 3) |
URL: | https://rrnni.biods.org/ |
NeedsCompilation: | yes |
Materials: | README |
CRAN checks: | rrnni results |
Reference manual: | rrnni.pdf |
Package source: | rrnni_0.1.1.tar.gz |
Windows binaries: | r-devel: rrnni_0.1.1.zip, r-release: rrnni_0.1.1.zip, r-oldrel: rrnni_0.1.1.zip |
macOS binaries: | r-release (arm64): rrnni_0.1.1.tgz, r-oldrel (arm64): rrnni_0.1.1.tgz, r-release (x86_64): rrnni_0.1.1.tgz, r-oldrel (x86_64): rrnni_0.1.1.tgz |
Old sources: | rrnni archive |
Please use the canonical form https://CRAN.R-project.org/package=rrnni to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.