Inferring (biological) signal transduction networks via transitive reductions of directed graphs
DOI10.1007/s00453-007-9055-0zbMath1147.68057OpenAlexW2045281324MaRDI QIDQ930591
Riccardo Dondi, Réka Albert, Bhaskar Das Gupta, 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
Approximation algorithms(Biological) signal transduction networksMinimum equivalent digraphTransitive reduction of directed graphs
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20) Mathematical biology in general (92B99)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational cell biology
- On strongly connected digraphs with bounded cycle length
- Approximation Algorithms for Several Graph Augmentation Problems
- Finding optimum branchings
- Approximating the Minimum Equivalent Digraph
- Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems
- The Transitive Reduction of a Directed Graph
This page was built for publication: Inferring (biological) signal transduction networks via transitive reductions of directed graphs