Difference between revisions of "MCL"
Jump to navigation
Jump to search
Moskalenko (talk | contribs) m (Text replace - "==Available versions== (.*)+ <!-- -->" to "<!--Modules-->") |
|||
| (12 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
__NOTOC__ | __NOTOC__ | ||
__NOEDITSECTION__ | __NOEDITSECTION__ | ||
| − | [[Category:Software]][[Category: | + | [[Category:Software]][[Category:Biology]][[Category:Genomics]] |
| − | + | {|<!--Main settings - REQUIRED--> | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | {| | ||
| − | <!--Main settings - REQUIRED--> | ||
|{{#vardefine:app|mcl}} | |{{#vardefine:app|mcl}} | ||
|{{#vardefine:url|http://www.micans.org/mcl/}} | |{{#vardefine:url|http://www.micans.org/mcl/}} | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|{{#vardefine:exe|}} <!--Present manual instructions for running the software --> | |{{#vardefine:exe|}} <!--Present manual instructions for running the software --> | ||
|{{#vardefine:conf|}} <!--Enable config wiki page link - {{#vardefine:conf|1}} = ON/conf|}} = OFF--> | |{{#vardefine:conf|}} <!--Enable config wiki page link - {{#vardefine:conf|1}} = ON/conf|}} = OFF--> | ||
| Line 34: | Line 19: | ||
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. | ||
| − | |||
<!--Modules--> | <!--Modules--> | ||
| − | + | ==Environment Modules== | |
| − | + | Run <code>module spider {{#var:app}}</code> to find out what environment modules are available for this application. | |
| + | ==System Variables== | ||
| + | * HPC_{{uc:{{#var:app}}}}_DIR - installation directory | ||
* HPC_MCL_* HPC_MCL_BIN - executable directory | * HPC_MCL_* HPC_MCL_BIN - executable directory | ||
* HPC_MCL_DOC - documentation directory | * HPC_MCL_DOC - documentation directory | ||
| Line 47: | Line 33: | ||
{{#if: {{#var: pbs}}|==PBS Script Examples== | {{#if: {{#var: pbs}}|==PBS Script Examples== | ||
See the [[{{PAGENAME}}_PBS]] page for {{#var: app}} PBS script examples.|}} | See the [[{{PAGENAME}}_PBS]] page for {{#var: app}} PBS script examples.|}} | ||
| − | {{#if: {{#var: policy}}|==Usage | + | {{#if: {{#var: policy}}|==Usage Policy== |
WRITE USAGE POLICY HERE (perhaps templates for a couple of main licensing schemes can be used)|}} | WRITE USAGE POLICY HERE (perhaps templates for a couple of main licensing schemes can be used)|}} | ||
{{#if: {{#var: testing}}|==Performance== | {{#if: {{#var: testing}}|==Performance== | ||
Latest revision as of 18:28, 18 August 2022
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.
Environment Modules
Run module spider mcl to find out what environment modules are available for this application.
System Variables
- HPC_MCL_DIR - installation directory
- HPC_MCL_* HPC_MCL_BIN - executable directory
- HPC_MCL_DOC - documentation directory
- HPC_MCL_MAN - manpage directory