Inferring (biological) signal transduction networks via transitive reductions of directed graphs
DOI10.1007/S00453-007-9055-0zbMATH Open1147.68057OpenAlexW2045281324MaRDI QIDQ930591FDOQ930591
Authors: Réka Albert, Riccardo Dondi, Bhaskar Dasgupta, Eduardo D. Sontag 
Publication date: 1 July 2008
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9055-0
Recommendations
Approximation algorithms(Biological) signal transduction networksMinimum equivalent digraphTransitive reduction of directed graphs
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Mathematical biology in general (92B99)
Cites Work
- Introduction to algorithms
- Finding optimum branchings
- Title not available (Why is that?)
- The Transitive Reduction of a Directed Graph
- Title not available (Why is that?)
- Computational cell biology
- Combinatorial optimization. Networks and matroids
- Approximating the Minimum Equivalent Digraph
- Approximation Algorithms for Several Graph Augmentation Problems
- On strongly connected digraphs with bounded cycle length
- Title not available (Why is that?)
- Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems
Cited In (5)
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
- On Making Directed Graphs Transitive
- Approximating Transitive Reductions for Directed Networks
- Parallel algorithms for transitive reduction for weighted graphs
- Minimal equivalent subgraphs containing a given set of arcs
This page was built for publication: Inferring (biological) signal transduction networks via transitive reductions of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930591)
