comparison readme.rst @ 0:4d1e4e729ae4 draft default tip

planemo upload for repository https://github.com/bgruening/galaxytools/tree/master/tools/mcl commit dcb4abd1fcf9114ced686c7343c2de4b064a57c1
author bgruening
date Tue, 12 Mar 2024 12:52:20 +0000
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:4d1e4e729ae4
1 ====================================
2 Galaxy wrapper for MCL cluster tools
3 ====================================
4
5 The MCL algorithm is short for the Markov Cluster Algorithm, a fast and scalable unsupervised cluster algorithm for graphs (also known as networks) 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 thesis, technical reports, and preprints can be found in this section. For quickly getting an idea of how MCL operates, consider the flow pictorial at the top of this page, or even better, have a look at an animation of the MCL process.
6
7 This wrapper is copyright 2013 by:
8 * Bjoern Gruening
9 * Pavan Videm
10
11
12 This prepository contains wrapper for the MCL_ command line tool.
13
14 .. _MCL: http://micans.org/mcl/
15
16
17
18 Stijn van Dongen, Graph Clustering by Flow Simulation, PhD thesis, University of Utrecht, May 2000.
19 ( http://www.library.uu.nl/digiarchief/dip/diss/1895620/inhoud.htm )
20
21 Stijn van Dongen, A cluster algorithm for graphs, Technical Report INS-R0010, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam, May 2000.
22 ( http://www.cwi.nl/ftp/CWIreports/INS/INS-R0010.ps.Z )
23
24 Stijn van Dongen, Graph clustering via a discrete uncoupling process, Siam Journal on Matrix Analysis and Applications 30-1, p121-141, 2008.
25
26 Stijn van Dongen and Cei Abreu-Goodger, Using MCL to extract clusters from networks, in Bacterial Molecular Networks: Methods and Protocols, Methods in Molecular Biology, Vol 804, pages 281—295 (2012). PMID 22144159.
27
28
29
30 ============
31 Installation
32 ============
33
34 MCL will be installed automatically with the Galaxy Tool Shed.
35
36
37
38 =======
39 History
40 =======
41
42 interproscan:
43
44 - v0.1: Initial public release of version 12.135
45
46
47 ===============================
48 Wrapper Licence (MIT/BSD style)
49 ===============================
50
51 Permission to use, copy, modify, and distribute this software and its
52 documentation with or without modifications and for any purpose and
53 without fee is hereby granted, provided that any copyright notices
54 appear in all copies and that both those copyright notices and this
55 permission notice appear in supporting documentation, and that the
56 names of the contributors or copyright holders not be used in
57 advertising or publicity pertaining to distribution of the software
58 without specific prior permission.
59
60 THE CONTRIBUTORS AND COPYRIGHT HOLDERS OF THIS SOFTWARE DISCLAIM ALL
61 WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED
62 WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL THE
63 CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY SPECIAL, INDIRECT
64 OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
65 OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
66 OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE
67 OR PERFORMANCE OF THIS SOFTWARE.
68