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.
Implementation of Kernelized score functions and other semi-supervised learning algorithms for node label ranking to analyze biomolecular networks. RANKS can be easily applied to a large set of different relevant problems in computational biology, ranging from automatic protein function prediction, to gene disease prioritization and drug repositioning, and more in general to any bioinformatics problem that can be formalized as a node label ranking problem in a graph. The modular nature of the implementation allows to experiment with different score functions and kernels and to easily compare the results with baseline network-based methods such as label propagation and random walk algorithms, as well as to enlarge the algorithmic scheme by adding novel user-defined score functions and kernels.
| Version: | 1.1 |
| Imports: | methods, graph, RBGL, limma, NetPreProc, PerfMeas |
| Suggests: | bionetdata |
| Published: | 2022-09-20 |
| DOI: | 10.32614/CRAN.package.RANKS |
| Author: | Giorgio Valentini [aut, cre] |
| Maintainer: | Giorgio Valentini <valentini at di.unimi.it> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | yes |
| CRAN checks: | RANKS results |
| Reference manual: | RANKS.pdf |
| Package source: | RANKS_1.1.tar.gz |
| Windows binaries: | r-devel: RANKS_1.1.zip, r-release: RANKS_1.1.zip, r-oldrel: RANKS_1.1.zip |
| macOS binaries: | r-release (arm64): RANKS_1.1.tgz, r-oldrel (arm64): RANKS_1.1.tgz, r-release (x86_64): RANKS_1.1.tgz, r-oldrel (x86_64): RANKS_1.1.tgz |
| Old sources: | RANKS archive |
Please use the canonical form https://CRAN.R-project.org/package=RANKS 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.