Results 101 to 110 of about 1,491 (176)

scIRT: Imputation and Dimensionality Reduction for Single-Cell RNA-Seq Data by Combining NMF with SMOTE. [PDF]

Int J Mol Sci
Mou Y, Li S, Ji G.
europepmc   +1 more source

Poster Sessions

HemaSphere, Volume 10, Issue S1, June 2026.
wiley   +1 more source

HasLoss: a novel Hassanat distance-based loss functions for binary classification. [PDF]

Front Artif Intell
Tarawneh AS.
europepmc   +1 more source

Publication Only

HemaSphere, Volume 10, Issue S1, June 2026.
wiley   +1 more source

AMIGO - Guided assignment of ¹³C-methyl labelled proteins. [PDF]

J Biomol NMR
Maass T, Rudolph L, Peters T, Mallagaray A.   +3 more
europepmc   +1 more source

On (a, d)-distance antimagic and 1-vertex bimagic vertex labelings of certain types of graphs

, 2018
Узагальнено результати для корони Pn○P1, які дають змогу стверджувати, що Pn○P1 не є (a, d)-дистанційним антимагічним графом для довільних значень a і d. Одержано умову існування (a, d)-дистанційної антимагічної розмітки гіперкуба Qn.
Семенюта, М.Ф.
core  

Diagnostically competitive performance of a physiology-informed generative multi-task network for contrast-free CT perfusion. [PDF]

Front Hum Neurosci
Khan W, Rees J, See KB, Kato S, Huang Z, Lazarte A, Douglas K, Lou X, Peng TJ, Rajderkar D, Sanelli P, Singh A, Tuna I, Wilson CA, Fang R.   +14 more
europepmc   +1 more source

Dorzagliatin shows potential in preventing cognitive impairment in diabetes: evidence from Mendelian randomization analysis and animal study. [PDF]

Front Endocrinol (Lausanne)
Ni J, Wang K, Feng L, Wang C, Li C, Chen Y, Chen L.   +6 more
europepmc   +1 more source

scE2EGAE: enhancing single-cell RNA-Seq data analysis through an end-to-end cell-graph-learnable graph autoencoder with differentiable edge sampling. [PDF]

Biol Direct
Wang S, Liu Y, Zhang H, Liu Z.
europepmc   +1 more source

Distance Magic Labeling of Corona Product of Graphs

InPrime: Indonesian Journal of Pure and Applied Mathematics
Let G = (V, E) is a graph with order n, and f: V(G) → {1,2,...,n} is a bijection. For any vertex v ϵ V, the sum of f(u) is called the weight of vertex v, denoted by w(v), where N(v)  is the set of neighbors of vertex v. If the labeling f satisfies that there exists a constant k such that w(v)=k, for every vertex v in the graph G, then f is called a ...
openaire   +1 more source