Results 1 to 10 of about 58,067 (136)

Transitive reduction of citation networks [PDF]

open access: yesJournal of Complex Networks, 2014
In many complex networks, the vertices are ordered in time, and edges represent causal connections. We propose methods of analysing such directed acyclic graphs taking into account the constraints of causality and highlighting the causal structure.
Clough, JR   +3 more
core   +7 more sources

On P-transitive graphs and applications [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show that the mu ...
Giacomo Lenzi
doaj   +4 more sources

Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks [PDF]

open access: yesBiology, 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   +2 more sources

fastBMA: scalable network inference and transitive reduction. [PDF]

open access: yesGigascience, 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 ...
Hung LH   +5 more
europepmc   +5 more sources

Efficient reconstruction of biological networks via transitive reduction on general purpose graphics processors [PDF]

open access: yesBMC 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   +2 more sources

TRANSWESD: inferring cellular networks with transitive reduction. [PDF]

open access: yesBioinformatics, 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 ...
Klamt S, Flassig RJ, Sundmacher K.
europepmc   +4 more sources

Analytical Study of Homogenization Causes in Translating Verbal Similar (Mutashābih) Verses into Persian, Case Study: Rezaei Esfahani’s Translation [PDF]

open access: yesدراسات في اللغة العربيّة وآدابها, 2022
In an ST-oriented translation, the translator tries to avoid changes. One of the translation changes is the homogenization that Antoine Berman refers to in his analytical model, which is the unification of the textural diversity of the origin. One of the
Ensiyeh Sadat Hashemi
doaj   +1 more source

Transitive Reduction Approach to Large-Scale Parallel Machine Rescheduling Problem With Controllable Processing Times, Precedence Constraints and Random Machine Breakdown

open access: yesIEEE 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   +1 more source

Psi-Calculi Revisited: Connectivity and Compositionality [PDF]

open access: yesLogical Methods in Computer Science, 2020
Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion calculus, the applied pi-calculus and the spi calculus.
Johannes Åman Pohjola
doaj   +1 more source

Transitive closure and transitive reduction in bidirected graphs [PDF]

open access: yesCzechoslovak 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.
Bessouf, Ouahiba   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy