Results 61 to 70 of about 2,975,002 (298)
Prospecting the protein design landscape
FEBS Letters, EarlyView.This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona +4 more
wiley +1 more source
Extending Graph Pattern Matching with Regular Expressions
, 2020 Graph pattern matching, which is to compute the set M(Q, G) of matches of Q in G, for the given pattern graph Q and data graph G, has been increasingly used in emerging applications e.g., social network analysis.
Xin Wang +9 more
core +1 more source
More on Signed Graphs with at Most Three Eigenvalues
Discussiones Mathematicae Graph Theory, 2022 We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertex-deleted subgraphs which themselves have at most 3 distinct eigenvalues.
Ramezani Farzaneh +2 more
doaj +1 more source
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 real equiangular tight frames obtained from rank 3 graphs
Electronic Journal of Graph Theory and ApplicationsWe present all nontrivial real equiangular tight frames {φm}m=1M in RN obtained as spherical embeddings of primitive rank 3 graphs on M vertices, and those such that one of their associated M strongly regular graphs on M - 1 vertices is a primitive rank ...
Eiichi Bannai +4 more
doaj +1 more source
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
A (49,16,3,6) strongly regular graph does not exist [PDF]
, 1988 Introduction. A strongly regular graph with 49 vertices and degree 16 has parameters (v, k, ¿, µ) = (49, 16, 3, 6). In this paper we show that such a graph cannot exist.
Matron, R. +10 more
core +2 more sources
Molecular Oncology, EarlyView.Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura +19 more
wiley +1 more source
Antimagic labeling of regular graphs
, 2016 A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,..., |E|} such that for any two vertices u, v, Σe∈ E(u) f(e)≠Σe∈E(v ) f(e).
Feihuang Chang; Yu-Chang Liang; Zhishi Pan; Xuding Zhu
core +1 more source
On Strongly Regular Graphs withμ= 1
European Journal of Combinatorics, 2001 The paper looks at strongly regular graphs in which each pair of non-adjacent vertices has exactly one common neighbour. Relationships between the parameters of such graphs are explored as are some of the associated particle linear spaces and distance-regular graphs.
J. Deutsch, P. H. Fisher
openaire +2 more sources