Free software is a cornerstone of any modern
free society. We build this foundation.
With your help, we will raise $450,000 this
winter to make this foundation even stronger.
Donate today, and build us up for 2014.
'MCL' (Markov Cluster Algorithm) is a fast and scalable cluster algorithm for graphs based on stochastic flow. The flow process that the algorithm uses is mathematically sound and intrinsically tied to cluster structure in graphs, which is revealed as the imprint left by the process. The threaded implementation has handled graphs of up to one million nodes within hours, and is widely used in the field of protein family analysis. It comes with sibling utilities for handling and analyzing graphs, matrices, and clusterings.
DocumentationUser manpage available in HTML, PS format from http://micans.org/mcl/man/distindex.html; User FAQ available in HTML, PS format from http://micans.org/mcl/man/distindex.html
released on 28 April 2005
|License||Verified by||Verified on||Notes|
|GPLv2orlater||Janet Casey||30 June 2005|
Leaders and contributors
|Stijn van Dongen||Maintainer|
Resources and communication
This entry (in part or in whole) was last reviewed on 30 June 2005.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software described in this text has its own copyright notice and license, which can usually be found in the distribution itself.