Difference between revisions of "Mcl-algorithm"

From Free Software Directory
Jump to: navigation, search
(Created page with "{{Entry |Name=mcl-algorithm |Short description=Cluster algorithm for graphs |Full description='MCL' (Markov Cluster Algorithm) is a fast and scalable cluster algorithm for graphs...")
 
(New version)
 
(One intermediate revision by one other user not shown)
Line 3: Line 3:
 
|Short description=Cluster algorithm for graphs
 
|Short description=Cluster algorithm for graphs
 
|Full description='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.
 
|Full description='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.
 +
|Homepage URL=http://micans.org/mcl/
 
|User level=none
 
|User level=none
 +
|Component programs=mcl,mcxassemble,mcx,mcxsubs,mcxmap,clminfo,clmmeet,clmdist,clmmate,clmformat,clmimac,clmresidue
 +
|Computer languages=C
 +
|Documentation note=User 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
 +
|Keywords=graphs,cluster,algorithm
 +
|Version identifier=14-137
 +
|Version date=2014/05/17
 +
|Version status=stable
 +
|Version download=http://micans.org/mcl/src/mcl-latest.tar.gz
 +
|Last review by=Alejandroindependiente
 +
|Last review date=2017/03/01
 
|Submitted by=Database conversion
 
|Submitted by=Database conversion
 
|Submitted date=2011-04-01
 
|Submitted date=2011-04-01
|Version identifier=05-096
+
|Status=
|Version date=2005-04-06
+
|Is GNU=No
|Version status=developmental
 
|Version download=
 
 
|License verified date=2005-06-30
 
|License verified date=2005-06-30
|Version comment=05-096 devel released 2005-04-06
 
 
}}
 
}}
 +
{{Project license
 +
|License=GPLv2orlater
 +
|License verified by=Janet Casey
 +
|License verified date=2005-06-30
 +
}}
 +
{{Person
 +
|Real name=Stijn van Dongen
 +
|Role=Maintainer
 +
|Resource URL=
 +
}}
 +
{{Resource
 +
|Resource audience=Developer
 +
|Resource kind=E-mail
 +
|Resource URL=mailto:mcl-devel@lists.micans.org
 +
}}
 +
{{Software category
 +
|Interface=command-line
 +
|Science=scientific-visualization
 +
|Use=science
 +
}}
 +
{{Featured}}

Latest revision as of 13:00, 1 March 2017


[edit]

mcl-algorithm

http://micans.org/mcl/
Cluster algorithm for graphs

'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.





Licensing

License

Verified by

Verified on

Notes

Verified by

Janet Casey

Verified on

30 June 2005




Leaders and contributors

Contact(s)Role
Stijn van Dongen Maintainer


Resources and communication

AudienceResource typeURI
DeveloperE-mailmailto:mcl-devel@lists.micans.org


Software prerequisites




Entry


















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 or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.