Results 91 to 100 of about 135,666 (285)
This study develops a novel miRNA‐based framework for estimating the time since deposition of semen stains, combining small RNA sequencing with machine learning. Time‐dependent miRNA modules were identified using Mfuzz clustering and WGCNA, followed by a multi‐stage feature selection pipeline that reduced 261 candidate miRNAs to a minimal 7‐miRNA panel.
Meiming Cai +11 more
wiley +1 more source
Graph Theoretic and Pearson Correlation-Based Discovery of Network Biomarkers for Cancer
Two graph theoretic concepts—clique and bipartite graphs—are explored to identify the network biomarkers for cancer at the gene network level.
Raihanul Bari Tanvir +4 more
doaj +1 more source
ABSTRACT Introduction Adolescence is a period of heightened vulnerability to psychopathology, when capacities for mentalising and interpersonal trust develop rapidly. This study investigated how configurations of reflective functioning (RF) and epistemic trust (ET) differentiate patterns of internalizing and externalizing problems in youth.
Ilaria Maria Antonietta Benzi +5 more
wiley +1 more source
On self-clique graphs with given clique sizes, II
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chia, G.L., Ong, Poh-Hwa
openaire +2 more sources
Adolescents' Experiences of Hate Speech and Psychological Needs: A Reflexive Thematic Analysis
ABSTRACT Introduction Adolescents are increasingly exposed to hate speech in both online and offline contexts, yet limited research has examined how such exposure is experienced and how it relates to adolescents' psychological needs and well‐being. Drawing on Self‐Determination Theory (SDT), this study explores how adolescents make sense of hate speech
Tomas Jungert +6 more
wiley +1 more source
On total directed graphs of non-commutative rings
For a non-commutative ring , the left total directed graph of is a directed graph with vertex set as and for the vertices and , is adjacent to if and only if there is a non-zero which is different from and , such that is a left zero-divisor of .
Kukil Kalpa Rajkhowa, Helen K. Saikia
doaj +1 more source
On self-clique graphs with triangular cliques
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Larrión, F. +2 more
openaire +2 more sources
R ( 5 , 5 ) ≤ 46 $R(5,5)\le 46$
ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) $R(5,5)$ is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley +1 more source
On Strongly and Robustly Critical Graphs
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
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
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

