scholarly journals The Network Analysis Profiler (NAP v2.0): A web tool for visual topological comparison between multiple networks

2020 ◽  
Author(s):  
Mikaela Koutrouli ◽  
Theodosios Theodosiou ◽  
Ioannis Iliopoulos ◽  
Georgios A. Pavlopoulos

ABSTRACTIn this article we present the Network Analysis Profiler (NAP v2.0), a web tool to directly compare the topological features of multiple networks simultaneously. NAP is written in R and Shiny and currently offers both 2D and 3D network visualization as well as simultaneous visual comparisons of node- and edge-based topological features both as bar charts or as a scatterplot matrix. NAP is fully interactive and users can easily export and visualize the intersection between any pair of networks using Venn diagrams or a 2D and a 3D multi-layer graph-based visualization. NAP supports weighted, unweighted, directed, undirected and bipartite graphs and is available at: http://bib.fleming.gr:3838/NAP/. Its code can be found at: https://github.com/PavlopoulosLab/NAP

2021 ◽  
Vol 26 ◽  
pp. e943
Author(s):  
Mikaela Koutrouli ◽  
Theodosios Theodosiou ◽  
Ioannis Iliopoulos ◽  
Georgios A. Pavlopoulos

In this article we present the Network Analysis Profiler (NAP v2.0), a web tool to directly compare the topological features of multiple networks simultaneously. NAP is written in R and Shiny and currently offers both 2D and 3D network visualisation, as well as simultaneous visual comparisons of node- and edge-based topological features as bar charts or scatterplot matrix. NAP is fully interactive, and users can easily export and visualise the intersection between any pair of networks using Venn diagrams or a 2D and a 3D multi-layer graph-based visualisation. NAP supports weighted, unweighted, directed, undirected and bipartite graphs.


2021 ◽  
Vol 26 (1) ◽  
pp. e943
Author(s):  
Mikaela Koutrouli ◽  
Theodosios Theodosiou ◽  
Ioannis Iliopoulos ◽  
Georgios A. Pavlopoulos

In this article we present the Network Analysis Profiler (NAP v2.0), a web tool to directly compare the topological features of multiple networks simultaneously. NAP is written in R and Shiny and currently offers both 2D and 3D network visualisation, as well as simultaneous visual comparisons of node- and edge-based topological features as bar charts or scatterplot matrix. NAP is fully interactive, and users can easily export and visualise the intersection between any pair of networks using Venn diagrams or a 2D and a 3D multi-layer graph-based visualisation. NAP supports weighted, unweighted, directed, undirected and bipartite graphs.


2020 ◽  
Author(s):  
Mikaela Koutrouli ◽  
Evangelos Karatzas ◽  
Katerina Papanikolopoulou ◽  
Georgios A. Pavlopoulos

AbstractNORMA is a web tool for interactive network annotation visualization and topological analysis, able to handle multiple networks and annotations simultaneously. Precalculated annotations (e.g. Gene Ontology/Pathway enrichment or clustering results) can be uploaded and visualized in a network either as colored pie-chart nodes or as color-filled convex hulls in a Venn-diagram-like style. In the case where no annotation exists, algorithms for automated community detection are offered. Users can adjust the network views using standard layout algorithms or allow NORMA to slightly modify them for visually better group separation. Once a network view is set, users can interactively select and highlight any group of interest in order to generate publication-ready figures. Briefly, with NORMA, users can encode three types of information simultaneously. These are: i) the network, ii) the communities or annotations and iii) node categories or expression values. Finally, NORMA offers basic topological analysis and direct topological comparison across any of the selected networks. NORMA service is available at: http://bib.fleming.gr:3838/NORMA or http://genomics-lab.fleming.gr:3838/NORMA. Code is available at: https://github.com/PavlopoulosLab/NORMA


2021 ◽  
Vol 8 (1) ◽  
pp. 205395172110184
Author(s):  
Tommaso Venturini ◽  
Mathieu Jacomy ◽  
Pablo Jensen

It is increasingly common in natural and social sciences to rely on network visualizations to explore relational datasets and illustrate findings. Such practices have been around long enough to prove that scholars find it useful to project networks in a two-dimensional space and to use their visual qualities as proxies for their topological features. Yet these practices remain based on intuition, and the foundations and limits of this type of exploration are still implicit. To fill this lack of formalization, this paper offers explicit documentation for the kind of visual network analysis encouraged by force-directed layouts. Using the example of a network of Jazz performers, band and record labels extracted from Wikipedia, the paper provides guidelines on how to make networks readable and how to interpret their visual features. It discusses how the inherent ambiguity of network visualizations can be exploited for exploratory data analysis. Acknowledging that vagueness is a feature of many relational datasets in the humanities and social sciences, the paper contends that visual ambiguity, if properly interpreted, can be an asset for the analysis. Finally, we propose two attempts to distinguish the ambiguity inherited from the represented phenomenon from the distortions coming from fitting a multidimensional object in a two-dimensional space. We discuss why these attempts are only partially successful, and we propose further steps towards a metric of spatialization quality.


2016 ◽  
Author(s):  
Stephen G. Gaffney ◽  
Jeffrey P. Townsend

ABSTRACTSummaryPathScore quantifies the level of enrichment of somatic mutations within curated pathways, applying a novel approach that identifies pathways enriched across patients. The application provides several user-friendly, interactive graphic interfaces for data exploration, including tools for comparing pathway effect sizes, significance, gene-set overlap and enrichment differences between projects.Availability and ImplementationWeb application available at pathscore.publichealth.yale.edu. Site implemented in Python and MySQL, with all major browsers supported. Source code available at github.com/sggaffney/pathscore with a GPLv3 [email protected] InformationAdditional documentation can be found at http://pathscore.publichealth.yale.edu/faq.


Author(s):  
Konstantinos Tatas ◽  
Kostas Siozios ◽  
Dimitrios Soudris ◽  
Axel Jantsch
Keyword(s):  
On Chip ◽  

CISM journal ◽  
1990 ◽  
Vol 44 (1) ◽  
pp. 9-18 ◽  
Author(s):  
Michael G. Sideris

The geoid and its horizontal derivatives, the deflections of the vertical, play an important role in the adjustment of geodetic networks. In the one-dimensional (1D) case, represented typically by networks of orthometric heights, the geoid provides the reference surface for the measurements. In the two-dimensional (2D) adjustment of horizontal control networks, the geoidal undulations N and deflections of the vertical ξ, η are needed for the reduction of the measured quantities onto the reference ellipsoid. In the three-dimensional (3D) adjustment, N and ξ, η are basically required to relate geodetic and astronomic quantities. The paper presents the major gravimetric methods currently used for predicting ξ, η and N, and briefly intercompares them in terms of accuracy, efficiency, and data required. The effects of N, ξ, η on various quantities used in the ID, 2D, and 3D network adjustments are described explicitly for each case and formulas are given for the errors introduced by either neglecting or using erroneous N, ξ, η in the computational procedures.


Sign in / Sign up

Export Citation Format

Share Document