RSAT
NeAT
Network Analysis Tools
> view all tools
Networks
Network comparison
Node topology statistics
Get node neighborhood
Randomize network
Alter network
Format conversion / layout calculation
Graph display
Path finding and pathway extraction
k-shortest path finding
Metabolic path finding
Pathway extraction
Pathway extraction (microme prototype)
Clusters
Compare classes/clusters
Contingency stats
Convert classification to different format
Clusters/Networks
MCL clustering
RNSC clustering
Map clusters onto network
Cluster membership
Graphics
Draw heatmap
Roc curves
ROC curves and stats
Data
Collect data from external servers
Download a subgraph from STRING
Download organism-specific networks from KEGG
Sample data
DEMO data
Nature protocol data
Web services
Documentation and clients
Taverna workflows
Help
Site map
Tutorial
Contact & Forum
Information
Introduction
People
Publications
Distribution
Credits
Links
Feedback
Sylvain Brohée
NeAT
- MCL
Fast and scalable unsupervised cluster algorithm for graphs based on simulation of (stochastic) flow in graphs.
The MCL program was developed by
Stijn van Dongen
(
Van Dongen, 2000, PhD thesis
;
Enright et al, 2002
)
The stand-alone version of MCL is available at
http://micans.org/mcl/
Input format
tab-delimited format
Adjacency matrix
GML format
Graph
Upload graph from file :
Column specification (only relevant for tab-delimited input)
Source node
Target node
Weight or label column
Inflation value
1.1
1.2
1.3
1.4
1.5
1.6
1.7
1.8
1.9
2
2.1
2.2
2.3
2.4
2.5
2.6
2.7
2.8
2.9
3
3.1
3.2
3.3
3.4
3.5
3.6
3.7
3.8
3.9
4
4.1
4.2
4.3
4.4
4.5
4.6
4.7
4.8
4.9
5
5.1
5.2
5.3
5.4
5.5
5.6
5.7
5.8
5.9
6
6.1
6.2
6.3
6.4
6.5
6.6
6.7
6.8
6.9
7
7.1
7.2
7.3
7.4
7.5
7.6
7.7
7.8
7.9
8
8.1
8.2
8.3
8.4
8.5
8.6
8.7
8.8
8.9
9
9.1
9.2
9.3
9.4
9.5
9.6
9.7
9.8
9.9
10
RESET
DEMO
MANUAL
TUTORIAL
MAIL