Back to Search Start Over

Finding the shortest path with PesCa: a tool for network reconstruction [version 2; referees: 2 approved, 2 approved with reservations]

Authors :
Giovanni Scardoni
Gabriele Tosadori
Sakshi Pratap
Fausto Spoto
Carlo Laudanna
Author Affiliations :
<relatesTo>1</relatesTo>Center for Biomedical Computing, University of Verona, Verona, Italy<br /><relatesTo>2</relatesTo>Birla Institute of Technology & Science, Goa, India<br /><relatesTo>3</relatesTo>Department of Computer Science, University of Verona, Verona, Italy<br /><relatesTo>4</relatesTo>Department of Medicine, University of Verona, Verona, Italy
Source :
F1000Research. 4:484
Publication Year :
2016
Publisher :
London, UK: F1000 Research Limited, 2016.

Abstract

Network analysis is of growing interest in several fields ranging from economics to biology. Several methods have been developed to investigate different properties of physical networks abstracted as graphs, including quantification of specific topological properties, contextual data enrichment, simulation of pathway dynamics and visual representation. In this context, the PesCa app for the Cytoscape network analysis environment is specifically designed to help researchers infer and manipulate networks based on the shortest path principle. PesCa offers different algorithms allowing network reconstruction and analysis starting from a list of genes, proteins and in general a set of interconnected nodes. The app is useful in the early stage of network analysis, i.e. to create networks or generate clusters based on shortest path computation, but can also help further investigations and, in general, it is suitable for every situation requiring the connection of a set of nodes that apparently do not share links, such as isolated nodes in sub-networks. Overall, the plugin enhances the ability of discovering interesting and not obvious relations between high dimensional sets of interacting objects.

Details

ISSN :
20461402
Volume :
4
Database :
F1000Research
Journal :
F1000Research
Notes :
Revised Amendments from Version 1 The updated version of this manuscript has some new features and some parts were modified in order to generalise some specific concepts. We started from correcting the terminology by removing two terms, i.e. Isolated Node and Giant Component, in order to avoid confusing terminologies. In this sense the app, in Cytoscape, will still use such terms while in the manuscript they only refer to the app functionalities. Here we used other terms that allow an easier comprehension. We also modified the motivation that guided the use of the shortest path while constructing networks, in order to let the users decide if PeSca fits the requirements. We described what happens when a node has degree equal to zero and is not connected to the network and why it can happen. We also give some hints that will help in connecting such nodes to the network. We described how to manage weighted networks and also directed networks and how this aspect can be exploited in different kind of networks. Moreover we corrected and modified figure 2 in order to make its caption correct and to let the figure being more easy to understand, by highlighting the paths. We also added a brief list of the available pre-loaded networks. Finally the Zenodo citation of the repository was added to the list of citations., , [version 2; referees: 2 approved, 2 approved with reservations]
Publication Type :
Academic Journal
Accession number :
edsfor.10.12688.f1000research.6769.2
Document Type :
software-tool
Full Text :
https://doi.org/10.12688/f1000research.6769.2