Results 61 to 70 of about 41,117 (251)
Nanomaterials, 2019 Calcia-alumina binary compounds doped with rare earths and some transition metals cations show persistent luminescence from the visible to the infrared range.
Rocío E. Rojas-Hernandez +5 more
doaj +1 more source
List strong edge coloring of some classes of graphs [PDF]
Australas. J Comb., 2014 7 pages; published ...
Watcharintorn Ruksasakchai +1 more
openaire +2 more sources
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
The Strong Chromatic Index of Complete Halin Graphs
MathematicsThe strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are incident to a common edge or share an endpoint. The strong chromatic index of a graph G, denoted by χs′(G),
Zhiwei Bi, Yunfang Tang
doaj +1 more source
Molecular Oncology, EarlyView.Loss of the miR‐214/199a cluster is associated with recurrence in ovarian cancer. Engineered small extracellular vesicles (m214‐sEVs) elevate miR‐214‐3p/miR‐199a‐5p in tumor cells, suppress β‐catenin, TLR4, and YKT6 signaling, reprogram tumor‐derived sEV cargo, reduce chemoresistance and migration, and enhance carboplatin efficacy and survival in ...
Weida Wang +12 more
wiley +1 more source
Strong 3-Rainbow Indexes of Closed Helm Graphs
Indonesian Journal of CombinatoricsLet G be a nontrivial, edge-colored, and connected graph of order m≥3 where adjacent edges may have the same color. A tree T in graph G is called a rainbow tree if all the edges in T have different colors.
Calista Suci Nugrahani +2 more
doaj +1 more source
Strong edge-colorings for $$k$$ k -degenerate graphs
Graphs and Combinatorics, 2014 We prove that the strong chromatic index for each $k$-degenerate graph with maximum degree $Δ$ is at most $(4k-2)Δ-k(2k-1)+1$.
openaire +2 more sources
Placement Delivery Arrays from Combinations of Strong Edge Colorings [PDF]
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA), 2019 It has recently been pointed out in both of the works [C. Shanguan, Y. Zhang, and G. Ge, {\em IEEE Trans. Inform. Theory}, 64(8):5755-5766 (2018)] and [Q. Yan, X. Tang, Q. Chen, and M. Cheng, {\em IEEE Commun. Lett.}, 22(2):236-239 (2018)] that placement delivery arrays (PDAs), as coined in [Q. Yan, M. Cheng, X. Tang, and Q.
Jerod Michel, Qi Wang 0012
openaire +2 more sources
Molecular Oncology, EarlyView.Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen +9 more
wiley +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source