Results 101 to 110 of about 2,422,838 (348)
Molecular Oncology, EarlyView.This nationwide study evaluated KRAS and NRAS mutations in 10 754 Turkish patients with metastatic colorectal cancer. The results revealed a mutation frequency of 51.1%, with 46.6% having KRAS mutations, 4.5% having NRAS mutations, and 48.5% being wild‐type for both.
Gozde Kavgaci +6 more
wiley +1 more source
Heinz Quarter Mean Labeling of Graphs
Ratio MathematicaMean labeling is one of the best-known labeling methods for graphs. Despite the large number of papers published on the subject of graph labeling, there are some particular formulas to be used by researchers to mean-label graphs.
Latha S, Sandhya SS
doaj +1 more source
Indian Journal Of Science And TechnologyObjectives: To introduce a new type of labeling called Discrete Labeling. This labeling aims at providing the maximum output whenever the inputs are distinct with rational distribution of neighbours thereby exhibiting the stronger form of Cordial labeling. This work serves as an aid in decision-making. Methods: The discrete labels 0 and 1 are cordially
A Punitha Tharani, P Saradha
openaire +2 more sources
Shotgun Assembly of Labeled Graphs
IEEE Transactions on Network Science and Engineering, 2019 Ver3: 23 pages, matches published version but with a corrected proof of Theorem 4.5 (result unchanged); Ver2: 22 pages; Ver1: 21 ...
Mossel, E, Ross, N
openaire +4 more sources
Molecular Oncology, EarlyView.Trastuzumab‐deruxtecan, a HER2‐targeting antibody‐drug conjugate, shows promising antitumor activity in head and neck squamous cell carcinoma with low HER2 expression. In vitro and in vivo studies demonstrated dose‐dependent cell death and tumor growth reduction in low HER2‐expressing cell lines, which correlated with drug accumulation measured using a
Abdullah Bin Naveed +8 more
wiley +1 more source
An Exact Algorithm for the Generalized List $T$-Coloring Problem
, 2013 The generalized list $T$-coloring is a common generalization of many graph coloring models, including classical coloring, $L(p,q)$-labeling, channel assignment and $T$-coloring. Every vertex from the input graph has a list of permitted labels.
Junosza-Szaniawski, Konstanty +1 more
core +2 more sources
Genomics‐led approach to drug testing in models of undifferentiated pleomorphic sarcoma
Molecular Oncology, EarlyView.GA text Genomic data from undifferentiated pleomorphic sarcoma patients and preclinical models were used to inform a targeted drug screen. Selected compounds were tested in 2D and 3D cultures of UPS cell lines. A combination of trametinib and infigratinib was synergistic in the majority of UPS cell lines tested, which was further confirmed in an ex ...
Piotr J. Manasterski +19 more
wiley +1 more source
Total Face Irregularity Strength of Grid and Wheel Graph under K-Labeling of Type (1, 1, 0)
Journal of Mathematics, 2021 In this study, we used grids and wheel graphs G=V,E,F, which are simple, finite, plane, and undirected graphs with V as the vertex set, E as the edge set, and F as the face set.
Aleem Mughal, Noshad Jamil
doaj +1 more source
Molecular Oncology, EarlyView.A DIA‐MS‐based proteomics analysis of serum samples from GB patients and healthy controls showed that high levels of IL1R2 and low levels of CRTAC1 and HRG in serum are associated with poor survival outcomes for GB patients. These circulating proteins could serve as biomarkers for the prediction of outcome in patients with GB.
Anne Clavreul +11 more
wiley +1 more source
Applied Mathematics and Computation, 2019 It is well known that the labeling problems of graphs arise in many (but not limited to) networking and telecommunication contexts. In this paper we introduce the anti-$k$-labeling problem of graphs which we seek to minimize the similarity (or distance) of neighboring nodes.
Xiaxia Guan +4 more
openaire +3 more sources