Network orientation via shortest paths

@article{Silverbush2014NetworkOV,
  title={Network orientation via shortest paths},
  author={Dana Silverbush and Roded Sharan},
  journal={Bioinformatics},
  year={2014},
  volume={30 10},
  pages={
          1449-55
        }
}
UNLABELLED The graph orientation problem calls for orienting the edges of a graph so as to maximize the number of pre-specified source-target vertex pairs that admit a directed path from the source to the target. Most algorithmic approaches to this problem share a common preprocessing step, in which the input graph is reduced to a tree by repeatedly contracting its cycles. Although this reduction is valid from an algorithmic perspective, the assignment of directions to the edges of the… 

Figures and Tables from this paper

Reconstructing signaling pathways using regular language constrained paths
TLDR
The key idea underlying RegLinker is the use of regular language constraints to control the number of non-pathway interactions that are present in the computed paths, which shows the broad potential of automated analysis to attenuate difficulties of traditional manual inquiry.
A systematic approach to orient the human protein–protein interaction network
TLDR
The authors use cancer genomic and drug response data to infer the direction of signal flow in the human PPI network and show that the directed network improves drug target and cancer driver gene prioritization.
Pathways on demand: automated reconstruction of human signaling networks
TLDR
PATHLINKER may serve as a promising approach for prioritizing proteins and interactions for experimental study, as illustrated by its discovery of a novel pathway in Wnt/β-catenin signaling.
Influence network model uncovers new relations between biological processes and mutational signatures
TLDR
Application of the GeneSigNet approach to breast and lung cancer data sets allowed us to capture a multitude of important relations between mutation signatures and cellular processes, and suggests a causative influence of the homologous recombination deficiency signature on a clustered APOBEC mutation signature and linked SBS8 with the NER pathway.
Controllability of protein-protein interaction phosphorylation-based networks: Participation of the hub 14-3-3 protein family
TLDR
Biological properties of nodes and edges of a human protein-protein interaction phosphorylation-based network, especially of those nodes critical for the network controllability are analyzed, finding that the minimal number of critical nodes needed to control the whole network is considerably lower compared to other real networks.
An optimization framework for network annotation
TLDR
This work presents a novel optimization framework for large‐scale sign annotation that employs different plausible models of signaling and combines them in a rigorous manner and obtains an accurate predictor that outperforms previous work by a considerable margin.
Program Synthesis for Systems Biology
Author(s): Koksal, Ali Sinan | Advisor(s): Bodik, Rastislav; Yosef, Nir | Abstract: Cell signaling controls basic cellular activities and coordinates cell actions, such as cell differentiation,
An overview of bioinformatics methods for modeling biological pathways in yeast.
TLDR
This work reviews selected bioinformatics approaches for modeling biological pathways in S. cerevisiae, including metabolic pathways, gene-regulatory pathways and signaling pathways, and discusses key biological databases.
LOAD BALANCING BETWEEN UNMANNED AERIAL VEHICLES OF A FLYING WIRELESS NETWORK USING AUTOMATIC REPLACEMENT AND CHARGING STATIONS
TLDR
It is shown that this problem can be transformed to the problem of finding the shortest path for each individual MUAV for load balancing between them and the method requires adjusting flights routes for the MUAVs between the ARCS and the flying wireless network for each duty cycle.
...
...

References

SHOWING 1-10 OF 26 REFERENCES
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations
TLDR
This work studies this variant of the graph orientation problem, provides strong inapproximability results for it and proposes an approximation algorithm for the problem, as well as for relaxations of it where the connecting paths need only be approximately shortest.
The Approximability of Shortest Path-Based Graph Orientations of Protein-Protein Interaction Networks
TLDR
This work studies the graph orientation problem, provides strong inapproximability results for it, and proposes approximation algorithms for the problem, as well as for relaxations where the connecting paths need only be approximately shortest.
Optimally Orienting Physical Networks
TLDR
This work provides a first polynomial-size ILP formulation for a network orientation problem, and finds that the algorithm achieves high accuracy and coverage in the orientation, outperforming simplified algorithmic variants that do not use information on edge directions.
Approximation Algorithms for Orienting Mixed Graphs
TLDR
The first approximation algorithm to graph orientation is given, which provides a sub-linear guarantee in the general case, and logarithmic guarantees for structured instances.
An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks
TLDR
This work considers a graph orientation problem arising in the study of biological networks, and provides an O(logn) approximation algorithm for the general case that achieves very tight approximation ratios in practice and is able to infer edge directions with high accuracy on both simulated and real network data.
Exploiting bounded signal flow for graph orientation based on cause-effect pairs
TLDR
Several biologically relevant special cases of the NP-hard problem can be solved to optimality and parameterized analysis yields both deeper insight into the computational complexity and practical solving strategies.
Discovering pathways by orienting edges in protein interaction networks
TLDR
This work formalizes the orientation problem in weighted protein interaction graphs as an optimization problem and presents three approximation algorithms based on either weighted Boolean satisfiability solvers or probabilistic assignments that are used to identify pathways in yeast.
A Network-based Approach for Predicting Missing Pathway Interactions
TLDR
This work introduces a framework for predicting new interactions that aid connectivity between upstream proteins (sources) and downstream transcription factors (targets) of a particular pathway and applies this method to extend pathways in osmotic stress response in yeast.
Physical Network Models
TLDR
A new framework for inferring models of transcriptional regulation, which is based on annotated molecular interaction graphs, is developed and successfully predicts gene knock-out effects with a high degree of accuracy in a cross-validation setting.
Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks
TLDR
The algorithm is capable of reconstructing known signaling pathways and identifying functionally enriched paths and trees in an unsupervised manner and is very efficient, computing optimal paths within minutes and paths of length 10 in about three hours.
...
...