NAViGaTOR Publisher's description
from Jurisica Lab
NAViGaTOR (Network Analysis, Visualization, & Graphing TORonto) is a software package for visualizing and analyzing protein-protein interaction networks.
NAViGaTOR (Network Analysis, Visualization, & Graphing TORonto) is a software package for visualizing and analyzing protein-protein interaction networks. NAViGaTOR can query OPHID / I2D - online databases of interaction data - and display networks in 2D or 3D. To improve scalability and performance, NAViGaTOR combines Java with OpenGL to provide a 2D/3D visualization system on multiple hardware platforms. NAViGaTOR also provides analytical capabilities and supports standard import and export formats such as GO and the Proteomics Standards Initiative (PSI).
* NAViGaTOR combines a visualization system implemented in OpenGL with a graphical user interface and analytical algorithms implemented in Java.
* Networks can be loaded from a file (tab-delimited, NAViGaTOR XML, BioPAX or PSI formats), or can be generated dynamically by executing a visual query to OPHID / I2D (Interologous Interaction Database -- an online database of known, HTP, and predicted protein-protein interactions for human, rat, mouse, fly, worm, and yeast) or cPath.
* The NAViGaTOR workspace supports multiple network panels which can be manipulated by cutting, copying and pasting nodes and edges.
* Networks can be exported in tab-delimited, NAViGaTOR XML, PSI, or Pajek formats, and multiple graphical formats (BMP, JPG, TIFF, SVG, PDF).
* Networks can be viewed in 2D and 3D.
* Nodes can be positioned using a mixture of automatic force-directed layout and manual placement. One of the automatic layout algorithms used is a multi-level force-directed layout algorithm called GRIP (Graph dRawing with Intelligent Placement) [Gajer and Kobourov, 8th Symposium on Graph Drawing (GD), 2000]. Because of the nearly linear time complexity of GRIP, NAViGaTOR can visualize full interactomes from I2D.
* Subnetworks that are highly interconnected, and nodes that are hubs (i.e. that interact with many other nodes), can be automatically identified to aid analysis.
* Groups of nodes can be collapsed into composite nodes, either manually, or in an automated fashion.
* Subsets of a network can be bookmarked and manipulated using standard set operations, such as union, intersection and difference.
* The opacity of nodes and edges can be adjusted to change the contrast of elements in the network and emphasize selected elements.
What's New in This Release:В· New I2D plugin with ability to query for extra data
В· MITAB file handler
В· User interface changes
В· PSI-MI XML file format fixes for node identifiers
В· Navigator XML file format saves network pan and zoom position
В· Subset edges are selectable and customizable
В· Better support for subsets
В· Linear/Circular layout can be sorted by features
В· New Hotbox controls for selecting neighbours, trees, chains and bicomponents
В· Ability to load interactions through Psicquic interface
В· BugFix: When node size is 'linked', it scales proportionally
System Requirements:В· Java Runtime Environment 1.5 or higher
В· 64 MB RAM
В· 300 MHz processor
В· 20 MB free hard drive space
В· OpenGL-capable video card not required, but up-to-date OpenGL drivers are necessary.
Program Release Status: New Release
Program Install Support: Install and Uninstall