Difference between revisions of "MCL"
Moskalenko (talk | contribs) (Created page with "__NOTOC__ __NOEDITSECTION__ Category:SoftwareCategory:Bioinformatics <!-- ######## Template Configuration ######## --> <!--Edit definitions of the variables used in temp...") |
Moskalenko (talk | contribs) m (Text replace - "{{App_Description|app={{#var:app}}|url={{#var:url}}}}|}}" to "{{App_Description|app={{#var:app}}|url={{#var:url}}|name={{#var:app}}}}|}} ") |
||
| Line 31: | Line 31: | ||
<!--Description--> | <!--Description--> | ||
{{#if: {{#var: url}}| | {{#if: {{#var: url}}| | ||
| − | {{App_Description|app={{#var:app}}|url={{#var:url}}}}|}} | + | {{App_Description|app={{#var:app}}|url={{#var:url}}|name={{#var:app}}}}|}} |
| + | |||
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 (that is, me) 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. The work for this thesis was carried out under supervision of Jan van Eijck and Michiel Hazewinkel. | 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 (that is, me) 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. The work for this thesis was carried out under supervision of Jan van Eijck and Michiel Hazewinkel. | ||
<!--Location--> | <!--Location--> | ||
Revision as of 01:53, 10 August 2012
Description
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 (that is, me) 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. The work for this thesis was carried out under supervision of Jan van Eijck and Michiel Hazewinkel. Template:App Location
Available versions
- 11-335
Running the application using modules
To use mcl with the environment modules system at HPC the following commands are available:
Get module information for mcl:
$module spider mcl
Load the default application module:
$module load mcl
The modulefile for this software adds the directory with executable files to the shell execution PATH and sets the following environment variables:
- HPC_MCL_DIR - directory where mcl is located.
- HPC_MCL_* HPC_MCL_BIN - executable directory
- HPC_MCL_DOC - documentation directory
- HPC_MCL_MAN - manpage directory