MCL: Markov Cluster Algorithm

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
DOI: 10.32614/CRAN.package.MCL
Author: Martin L. J├Ąger
Maintainer: Ronja Foraita <foraita at>
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:, r-release:, r-oldrel:
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 dependencies:

Reverse imports: aPEAR, HPiP, mina, miRSM, RITAN
Reverse suggests: FCPS, simplifyEnrichment


Please use the canonical form to link to this page.