Results 231 to 240 of about 62,209 (271)

Artificial Intelligence Powers Protein Functional Annotation

open access: yesAdvanced Science, Volume 13, Issue 26, 8 May 2026.
This review systematically summarizes how artificial intelligence advances protein functional annotation. It organizes existing methods into six unified modeling paradigms and analyzes their applications in Gene Ontology and Enzyme Commission prediction.
Wenkang Wang   +4 more
wiley   +1 more source

Peripheral vascular function, including endothelium‐dependent measures, and dementia risk: The Framingham Heart Study

open access: yesAlzheimer's &Dementia, Volume 22, Issue 5, May 2026.
Abstract INTRODUCTION The relationship between peripheral vascular health, including endothelia, cognitive decline, and Alzheimer's disease (AD) dementia risk is unclear. METHODS In this study, 2844 dementia‐free Framingham Offspring participants (mean age 60.6 years, 53.2% women) had baseline brachial artery flow‐mediated dilation (FMD%) and reactive ...
Qiushan Tao   +15 more
wiley   +1 more source

Directed acyclic graphs in clinical research

European Journal of Endocrinology
Abstract Directed acyclic graphs (DAGs), or causal diagrams, are graphical representations of causal structures that can be used in medical research to understand and illustrate potential bias, including bias arising from confounding, selection, and misclassification.
Olaf M Dekkers   +2 more
openaire   +4 more sources

Directed Acyclic Graphs in Surgical Research

Journal of Surgical Research, 2023
Surgical research often utilizes multivariable regression to evaluate causal relationships between variables, but there is usually little explanation of the decision-making regarding which variables were controlled for. We propose that directed acyclic graphs (DAGs)-a formal logic tool that illustrates connections between variables-should be used to ...
AlleaBelle Gongola, Jace C. Bradshaw
openaire   +2 more sources

Collapsibility for Directed Acyclic Graphs

Scandinavian Journal of Statistics, 2009
Abstract. Collapsibility means that the same statistical result of interest can be obtained before and after marginalization over some variables. In this paper, we discuss three kinds of collapsibility for directed acyclic graphs (DAGs): estimate collapsibility, conditional independence collapsibility and model collapsibility. Related to collapsibility,
Xie, Xianchao, Geng, Zhi
openaire   +2 more sources

Propagating Distributions Up Directed Acyclic Graphs

Neural Computation, 1999
In a previous article, we considered game trees as graphical models. Adopting an evaluation function that returned a probability distribution over values likely to be taken at a given position, we described how to build a model of uncertainty and use it for utility-directed growth of the search tree and for deciding on a move after search was completed.
E B, Baum, W D, Smith
openaire   +2 more sources

Recursive Processing of Directed Acyclic Graphs

2002
Recursive neural networks axe a new connectionist model particularly tailored to process Directed Positional Acyclic Graphs (DPAGs) [4]. While this assumption is reasonable in some applications, it introduces unnecessary constraints in others. In this paper, it is shown that the constraint on the ordering can be relaxed by using an appropriate weight ...
BIANCHINI M., GORI M., SCARSELLI F.
openaire   +2 more sources

Compact Morphic Directed Acyclic Word Graphs

The Computer Journal, 2001
Summary: A Directed Acyclic Word Graph (DAWG) represents all factors of a string \(t\) over \(\Sigma\). By some isomorphism \(h: \Sigma^*\to (\sigma^q)^*\), with parameter \(q\), the string \(t\) can be transformed into \(h(t)\), the factors of which are represented by another DAWG, called the morphic DAWG, over a different alphabet \(\sigma ...
openaire   +2 more sources

On Mergings in Acyclic Directed Graphs

SIAM Journal on Discrete Mathematics, 2019
Summary: Consider an acyclic directed graph \(G\) with sources \(s_1, s_2, \ldots,s_n\) and sinks \(r_1, r_2, \ldots, r_n\). For \(i=1, 2, \ldots,n\), let \(c_i\) denote the size of the minimum edge cut between \(s_i\) and \(r_i\), which, by Menger's theorem, implies that there exists a group of \(c_i\) edge-disjoint paths from \(s_i\) to \(r_i ...
openaire   +1 more source

Home - About - Disclaimer - Privacy