Information about software packages installed on the ICHEC systems.
The MCL algorithm is short for the Markov Cluster Algorithm, a fast and scalable unsupervised cluster algorithm for networks (also known as graphs) based on simulation of (stochastic) flow in graphs. The algorithm was invented/discovered by Stijn van Dongen at the Centre for Mathematics and Computer Science (also known as CWI) in the Netherlands. The PhD thesis Graph clustering by flow simulation is centered around this algorithm, the main topics being the mathematical theory behind it, its position in cluster analysis and graph clustering, issues concerning scalability, implementation, and benchmarking, and performance criteria for graph clustering in general.
To use MCL, load the relevant environment module:
Further information can be obtained from http://www.micans.org/mcl/.
How to cite MCL:
Please refer to http://www.micans.org/mcl/sec_license.html for instructions on citing usage of MCL.