Results 141 to 150 of about 587,547 (217)

Learning Continuous Decomposable Models Using Mutual Information and Statistical Copulas. [PDF]

Entropy (Basel)
Desuó Neto L, de Oliveira Caetano H, de Souza Sant'Anna Fogliatto M, Dias Maciel C.   +3 more
europepmc   +1 more source

A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph

, 2001
We give O(m + n) algorithms for enumerating all minimum separators as well as minimal separators in a connected chordal graph. We give a tight upper bound, n - κ(G) - 1, for the number of minimal separators in a chordal graph.
Chandran, LS
core  

Protein Profile of Multiple Myeloma‐Derived Extracellular Vesicles for the Discovery of Novel Myeloma‐Related Biomarkers

Cancer Science, Volume 117, Issue 10, Page 2877-2890, October 2026.
Comparison of extracellular vesicles with parental cells through proteomic profiling, followed by an integrated bioinformatic pipeline including disease association and transcriptomic analyses, identifies candidate biomarkers for multiple myeloma. Among these, MIF emerges as a clinically relevant marker, supported by validation in patient samples and ...
Natalia Platonova, Gilda Aiello, Domenica Ronchetti, Valentina Citro, Rosanna Asselta, Lavinia Casati, Domenica Giannandrea, Elisa Taiana, Antonino Neri, Gloria Sini, Elisabetta Calzavara, Mauro Turrini, Alfonsina D'Amato, Raffaella Chiaramonte   +13 more
wiley   +1 more source

Probabilistic Joint and Individual Variation Explained (ProJIVE) for Data Integration. [PDF]

J Comput Graph Stat
Murden RJ, Tian G, Qiu D, Risk BB.
europepmc   +1 more source

On the maximum likelihood degree of Gaussian graphical models

Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract In this paper we revisit the likelihood geometry of Gaussian graphical models. We give a detailed proof that the ML‐degree behaves monotonically on induced subgraphs. Furthermore, we complete a missing argument that the ML‐degree of the nth$n{\rm th}$ cycle is larger than 1 for any n⩾4$n\geqslant 4$, therefore completing the characterization ...
Carlos Améndola, Rodica Andreea Dinu, Mateusz Michałek, Martin Vodička   +3 more
wiley   +1 more source

Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]

Front Comput Neurosci
Wang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc   +1 more source

Graph Colorings on Chordal Graphs

, 2007
Since chordal graphs possess an excellent ("perfect") property on ordinary (vertex) coloring, it is interesting to see what would happen on different colorings.
Roger Yeh
core  

Myocardial dysfunction associated with low-dose endotoxin administration in adult horses. [PDF]

J Vet Intern Med
Williams Louie E, Cercone M, Delvescovo B, Chevalier J, Mitchell K.   +4 more
europepmc   +1 more source

Chordal Probe Graphs (Extended Abstract)

, 2008
In this paper, we introduce the class of chordal probe graphs which are a generalization of both interval probe graphs and chordal graphs. A graph G is chordal probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N ...
Martin Charles, Martin Charles Golumbic, Marina Lipshteyn   +2 more
core  

Case Report: Parachute tricuspid valve in association with cyanotic congenital heart disease and juxtaposed atrial appendages in a 1-year-old boy-a rare anatomical association. [PDF]

Front Cardiovasc Med
Sangwan D, Marwah A, Jain V.
europepmc   +1 more source