Results 171 to 180 of about 110,794 (282)

Stratification of chronic rhinosinusitis with nasal polyps by distinct sinonasal microbial communities and their clinical and pathological correlations

open access: yesiMetaOmics, EarlyView.
Chronic rhinosinusitis with nasal polyps (CRSwNP) is a heterogeneous inflammatory condition. Dysbiosis is commonly observed. This study identified distinct sinonasal microbial communities in CRSwNP patients and explored their clinical and pathological associations. Two distinct microbial communities were identified: community type 1 (CT1), dominated by
Bixing Fang   +10 more
wiley   +1 more source

Quantum speedup for nonreversible Markov chains. [PDF]

open access: yesNat Commun
Claudon B, Piquemal JP, Monmarché P.
europepmc   +1 more source

Validation of a Multiparametric, Automated, Macroarray‐Based Assay for the Detection of Autoantibodies in Autoimmune Liver Disease

open access: yesJournal of Clinical Laboratory Analysis, EarlyView.
The assay exploited a multiparametric and fully automated device applied to CHORUS EVO to validate that the CHORUS Macroarray Liver Diseases kit is a novel procedure for detecting autoantibodies of AIH and PBC. The assay resulted as linear, accurate, sensitive, specific, and able to distinguish between PBC and AIH.
Luigi Raganelli   +14 more
wiley   +1 more source

On Strongly and Robustly Critical Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k $k$‐critical yet L $L$‐colorable with ...
Anton Bernshteyn   +3 more
wiley   +1 more source

Sensitivity and Hamming Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT For any m ≥ 3 $m\ge 3$ we show that the Hamming graph H ( n , m ) $H(n,m)$ admits an imbalanced partition into m $m$ sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong m $m$‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio   +3 more
wiley   +1 more source

Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy