Results 61 to 70 of about 7,663 (277)

Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin

open access: yesMolecular Oncology, EarlyView.
The ruthenium‐based metallodrug plecstatin exerts its anticancer effect in hepatocellular carcinoma (HCC) primarily through selective targeting of plectin. By disrupting plectin‐mediated cytoskeletal organization, plecstatin inhibits anchorage‐dependent growth, cell polarization, and tumor cell dissemination.
Zuzana Outla   +10 more
wiley   +1 more source

An Algorithmic Framework for Labeling Network Maps

open access: yes, 2015
Drawing network maps automatically comprises two challenging steps, namely laying out the map and placing non-overlapping labels. In this paper we tackle the problem of labeling an already existing network map considering the application of metro maps ...
A Goethem van   +8 more
core   +1 more source

Neutrosophic Labeling Graph

open access: yesNeutrosophic Sets and Systems, 2019
In this paper, some new connectivity concepts in neutrosophic labeling graphs are portrayed. Definition of neutrosophic strong arc, neutrosophic partial cut node, Neutrosophic Bridge and block are introduced with examples. Also, neutrosophic labeling tree and partial intuitionistic fuzzy labeling tree is explored with interesting properties.
M. Gomathi, V. Keerthika
openaire   +2 more sources

Infrared laser sampling of low volumes combined with shotgun lipidomics reveals lipid markers in palatine tonsil carcinoma

open access: yesMolecular Oncology, EarlyView.
Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff   +11 more
wiley   +1 more source

Good edge-labelling of graphs [PDF]

open access: yesElectronic Notes in Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Araujo, Julio   +3 more
openaire   +3 more sources

A Partial Solution to an Open Problem on Super Edge-Magic Total Labelings of 4,3-Cycle Books Graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences
Let H be a graph with h vertices and e edges. An edge-magic-total labeling of graph H is a bijective function g:VH∪EH⟶1,2,…,h+e such that ga+ga,b+gb=k,∀a,b∈EH. When g:VH⟶1, 2,…, h, it is termed a super edge-magic total labeling.
Baki Swita   +7 more
doaj   +1 more source

TRAIL‐PEG‐Apt‐PLGA nanosystem as an aptamer‐targeted drug delivery system potential for triple‐negative breast cancer therapy using in vivo mouse model

open access: yesMolecular Oncology, EarlyView.
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 PI3Kδ inhibitor roginolisib (IOA‐244) preserves T‐cell function and activity

open access: yesMolecular Oncology, EarlyView.
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

Swapping Labeled Tokens on Graphs [PDF]

open access: yesTheoretical Computer Science, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yamanaka, Katsuhisa   +9 more
openaire   +6 more sources

A complete L(2,1) span characterization for small trees

open access: yesAKCE International Journal of Graphs and Combinatorics, 2015
An L(2,1) labeling of a graph G is a vertex labeling such that any pair of vertices vi and vj must have labels at least 2 apart if d(vi,vj)=1 and labels at least 1 apart if d(vi,vj)=2. The span of an L(2,1) labeling f on a graph G is the maximum f(u) for
Christopher A. Wood, Jobby Jacob
doaj   +1 more source

Home - About - Disclaimer - Privacy