Results 101 to 110 of about 3,915 (163)

Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)

open access: yes
In his Ph.D. thesis, Farber proved that every strongly chordal graph can be represented as intersection graph of subtrees of a weighted tree, and these subtrees are ``compatible''. Moreover, this is an equivalent characterization of strongly chordal graphs. To my knowledge, Farber never published his results in a conference or a journal, and the thesis
openaire   +2 more sources

Robust characterization and interpretation of rare pathogenic cell populations from spatial omics using GARDEN. [PDF]

open access: yesNat Commun
Zhang X   +9 more
europepmc   +1 more source

On Graphical Models and Convex Geometry. [PDF]

open access: yesComput Stat Data Anal, 2023
Bar H, Wells MT.
europepmc   +1 more source

Unveiling patterns: an exploration of machine learning techniques for unsupervised feature selection in single-cell data. [PDF]

open access: yesBrief Bioinform
Chatterjee N   +6 more
europepmc   +1 more source

Serum proteomics mirrors the histopathological changes underlying different etiologies of primary mitral valve disease. [PDF]

open access: yesBiosci Rep
Garcia-Peña A   +12 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy