| Literature DB >> 30057757 |
Li Jun Huang1, Jeffrey N Law2, T M Murali1,3.
Abstract
PathLinker is a graph-theoretic algorithm originally developed to reconstruct the interactions in a signaling pathway of interest. It efficiently computes multiple short paths within a background protein interaction network from the receptors to transcription factors (TFs) in a pathway. Since December 2015, PathLinker has been available as an app for Cytoscape. This paper describes how we automated the app to use the CyRest infrastructure and how users can incorporate PathLinker into their software pipelines.Entities:
Keywords: CyREST API; Network Biology; Pathway Reconstruction; Shortest Paths
Year: 2018 PMID: 30057757 PMCID: PMC6051191 DOI: 10.12688/f1000research.14616.1
Source DB: PubMed Journal: F1000Res ISSN: 2046-1402
Figure 2. PathLinker application programming interface (API) functions shown in the Swagger user interface.
Figure 3. Illustration of the first use case.
Figure 1. Comparison of P athL inker parameters in the app and in the API.
P athL inker application programming interface (API) parameters.
The last column records whether an equivalent option is present in the user interface of the P athL inker app. T/F - True/False.
| Parameter | Type | Description | Present
|
|---|---|---|---|
| sources | String | Node names separated by spaces | ✓ |
| targets | String | Node names separated by spaces | ✓ |
|
| Integer | Number of paths to compute | ✓ |
| edgeWeightType | String | UNWEIGHTED, ADDITIVE, or PROBABILITIES | ✓ |
| edgePenalty | Integer | Penalize low-weight paths with many edges | ✓ |
| edgeWeightColumnName | String | Name of the Edge Table column that contains the edge
| ✓ |
| allowSourcesTargetsInPaths | T/F | Allow sources and targets to be intermediate nodes in paths | ✓ |
| includeTiedPaths | T/F | Include more than
| ✓ |
| treatNetworkAsUndirected | T/F | Ignore directionality when computing paths | ✓ |
| skipSubnetworkGeneration | T/F | Return only the
|