The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
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[@]dogado.de.
Contains the Markov cluster algorithm (MCL) for identifying clusters in networks and graphs. The algorithm simulates random walks on a (n x n) matrix as the adjacency matrix of a graph. It alternates an expansion step and an inflation step until an equilibrium state is reached.
| Version: | 1.0 |
| Depends: | R (≥ 2.10.0) |
| Imports: | expm |
| Published: | 2015-03-11 |
| Author: | Martin L. Jäger |
| Maintainer: | Ronja Foraita <foraita at bips.uni-bremen.de> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| CRAN checks: | MCL results |
| Reference manual: | MCL.pdf |
| Package source: | MCL_1.0.tar.gz |
| Windows binaries: | r-devel: MCL_1.0.zip, r-release: MCL_1.0.zip, r-oldrel: MCL_1.0.zip |
| macOS binaries: | r-release (arm64): MCL_1.0.tgz, r-oldrel (arm64): MCL_1.0.tgz, r-release (x86_64): MCL_1.0.tgz, r-oldrel (x86_64): MCL_1.0.tgz |
| Reverse imports: | aPEAR, HPiP, mina, miRSM, RITAN |
| Reverse suggests: | FCPS, simplifyEnrichment |
Please use the canonical form https://CRAN.R-project.org/package=MCL 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.
Health stats visible at Monitor.