Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks [PDF]
Biology, 2013 In this survey paper, we will present a number of core algorithmic questions concerning several transitive reduction problems on network that have applications in network synthesis and analysis involving cellular processes. Our starting point will be the
Satabdi Aditya +2 more
doaj +3 more sources
fastBMA: scalable network inference and transitive reduction [PDF]
GigaScience, 2017 AbstractBACKGROUND:Inferring genetic networks from genome-wide expression data is extremely demanding computationally. We have developed fastBMA, a distributed, parallel and scalable implementation of Bayesian model averaging (BMA) for this purpose. fastBMA also includes a novel and computationally efficient method for eliminating redundant indirect ...
Ling‐Hong Hung +5 more
europepmc +7 more sources
Efficient reconstruction of biological networks via transitive reduction on general purpose graphics processors [PDF]
BMC Bioinformatics, 2012 Background Techniques for reconstruction of biological networks which are based on perturbation experiments often predict direct interactions between nodes that do not exist.
Bošnački Dragan +4 more
doaj +3 more sources
TRANSWESD: inferring cellular networks with transitive reduction [PDF]
Bioinformatics, 2010 Abstract Motivation: Distinguishing direct from indirect influences is a central issue in reverse engineering of biological networks because it facilitates detection and removal of false positive edges. Transitive reduction is one approach for eliminating edges reflecting indirect effects but its use in reconstructing cyclic interaction ...
Steffen Klamt +2 more
europepmc +5 more sources
Transitive Reduction of Citation Networks [PDF]
Journal of Complex Networks, 2014 17 pages, 13 figures, data ...
James R. Clough, Tim Evans, Tamar Loach
+13 more sources
One Edge at a Time: A Novel Approach Towards Efficient Transitive Reduction Computation on DAGs [PDF]
IEEE Access, 2020 Given a directed acyclic graph (DAG) G, G's transitive reduction (TR) Gtr is the unique DAG satisfying that Gtr has the minimum number of edges and has the same transitive closure (TC) as G.
Xian Tang +5 more
doaj +2 more sources
Transitive closure and transitive reduction in bidirected graphs [PDF]
Czechoslovak Mathematical Journal, 2019 In a bidirected graph an edge has a direction at each end, so bidirected graphs generalize directed graphs. We generalize the definitions of transitive closure and transitive reduction from directed graphs to bidirected graphs by introducing new notions of bipath and bicircuit that generalize directed paths and cycles.
Ouahiba Bessouf +2 more
openalex +4 more sources
Transitive Reduction Approach to Large-Scale Parallel Machine Rescheduling Problem With Controllable Processing Times, Precedence Constraints and Random Machine Breakdown [PDF]
IEEE Access, 2023 This paper studied a novel parallel machine rescheduling problem with controllable processing times under machine breakdown and precedence constraints.
De Meng +3 more
doaj +2 more sources
, 2007 Quick note to self, having stumbled on the Wikipedia page on transitive reduction. Given a graph like this:the transitive reduction is:Note that the original graph has an edge a -> d, but this is absent after the reduction because we can get from a to d via b (or c). What's the point?
Roderic Page
+4 more sources
Fully Dynamic Algorithms for Transitive Reduction [PDF]
Accepted at ICALP ...
Gramoz Goranci +3 more
+7 more sources