Results 61 to 70 of about 115,450 (267)
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat +8 more
wiley +1 more source
The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$ [PDF]
The existence of $srg(99,14,1,2)$ has been a question of interest for several decades to the moment. In this paper, we consider the structural properties in general for the family of strongly regular graphs with parameters $\lambda =1$ and $\mu =2$.
Reimbay Reimbayev
doaj +1 more source
Existence of Regular Nut Graphs for Degree at Most 11
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W. +4 more
doaj +1 more source
The PI3Kδ inhibitor roginolisib (IOA‐244) preserves T‐cell function and activity
Identification of novel PI3K inhibitors with limited immune‐related adverse effects is highly sought after. We found that roginolisib and idelalisib inhibit chronic lymphocytic leukemia (CLL) cells and Treg suppressive functions to similar extents, but roginolisib affects cytotoxic T‐cell function and promotion of pro‐inflammatory T helper subsets to a
Elise Solli +7 more
wiley +1 more source
Spectra of R-Vertex Join and R-Edge Join of Two Graphs
The R-graph R(G) of a graph G is the graph obtained from G by intro- ducing a new vertex ue for each e ∈ E(G) and making ue adjacent to both the end vertices of e. In this paper, we determine the adjacency, Lapla- cian and signless Laplacian spectra of R-
Das Arpita, Panigrahi Pratima
doaj +1 more source
Cogrowth of regular graphs [PDF]
Let G \mathcal {G} be a d d -regular graph and T T the covering tree of G \mathcal {G} . We define a cogrowth constant of G \mathcal {G} in T T and express it in terms of the first eigenvalue of the Laplacian on
openaire +2 more sources
This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns +10 more
wiley +1 more source
The authors study the problem of \(r\)-regular graph generation. The considered graphs can posses multiple edges between each pair \((x,y)\) of vertices, so they can be seen as labeled graphs with an integer accompanying each edge. Therefore, the subjective loopless graphs can be seen as flow networks. Two general approaches to generation are discussed.
Ding, Guoli, Chen, Peter
openaire +2 more sources
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova +25 more
wiley +1 more source
Targeted modulation of IGFL2‐AS1 reveals its translational potential in cervical adenocarcinoma
Cervical adenocarcinoma patients face worse outcomes than squamous cell carcinoma counterparts despite similar treatment. The identification of IGFL2‐AS1's differential expression provides a molecular basis for distinguishing these histotypes, paving the way for personalized therapies and improved survival in vulnerable populations globally.
Ricardo Cesar Cintra +6 more
wiley +1 more source

