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
- graph-neighbours
Extract from a graph the neighbourhood of a set of seed nodes.
This program was developed by
Sylvain Brohée
and
Jacques van Helden
.
Input format
tab-delimited format
Adjacency matrix
GML format
Output format
Classification output
One line for each seed node (weighted graph only)
Distance from seed node
Graph
Upload graph from file :
Column specification (only relevant for tab-delimited input)
Source node
Target node
Weight or label column
Direction of the neighbourhood
All directions
Out neighbours
In neighbours
Include each node in its neighborhood (with a distance of zero)
Seed node selection
All nodes
Node selection
Upload seed nodes from file :
RESET
DEMO
MANUAL
TUTORIAL
MAIL