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
- Pathfinder
Do multiple-to-multiple end path finding. Click on
for help.
Web service and interface by
Karoline Faust
. This program calls REA (Jimenez and Marzal, 1999). See
Credits
for other contributors.
1. Network
Enter the network here (tab-delimited* or gml):
*The tab-delimiter can be replaced by two white spaces.
Or
upload the network from a file:
OR
enter a network id (id of previously submitted network):
Input format
tab-delimited format
GML format
Directed network
Store network on server
2. Seed nodes
Info: Matching of provided identifiers to identifiers of nodes in the network is case-insensitive.
Enter source and target nodes:
Source nodes
Target nodes
Or
upload a batch file:
3. Path finding options
Rank
Warning: The edge weight is seen as edge cost, not as edge strength!
Weighting scheme
unit weight
as given in input graph
degree of nodes as weight
Identifiers of nodes to exclude
Identifiers of nodes to include
Maximal path weight
Maximal path length
Minimal path length
4. Output
Output format
Table:
Graph:
Graph format:
tab-delimited format
GML format
Graph output type:
each path as a separated component of a single graph
paths unified into one graph
input graph with paths highlighted
Email (optional)
RESET
DEMO1
DEMO2
ADVANCED
MANUAL
TUTORIAL
MAIL
WSDL