Results 71 to 80 of about 9,933,640 (289)
Structure‐forward targeting of claudins with synthetic binders
FEBS Letters, EarlyView.Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source
Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics
FEBS Letters, EarlyView.Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt +8 more
wiley +1 more source
Doubly connected edge domination number of a graph.
, 2015 A set F of a graph is an edge dominating set if every edge in is adjacent to some edge in F. An edge domination number of G is the minimum cardinality of an edge dominating set. An edge dominating set F is called a doubly connected edge dominating set
Venkanagouda, M.G. +2 more
core +1 more source
The Graphs Whose Sum of Global Connected Domination Number and Chromatic Number is 2n-5 [PDF]
, 2012 A subset S of vertices in a graph G = (V,E) is a dominating set if every vertex in V-S is adjacent to atleast one vertex in S. A dominating set S of a connected graph G is called a connected dominating set if the induced sub graph < S > is ...
G, Mahadevan +2 more
core +1 more source
Valency based domination number for Mycielskian of some graphs [PDF]
Mathematics and Computational SciencesLet G = (V, E) be a connected graph and γvb(G) denotes the valency based domination number of G or simply vb-domination number of G. In this paper, analogous to isolated vertex in domination, defined valency based isolated vertex (or simply, vb-isolated ...
Kavitha Thilakan +1 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2021 In this paper, we study a new distance parameter triameter of a connected graph G, which is defined as max{d(u; v)+d(v;w)+d(u;w) : u; v;w ∈ V }and is denoted by tr(G).
Das Angsuman
doaj +1 more source
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
Connected domination number of graph [PDF]
, 2014 V diplomskem delu je obravnavano povezano dominantno število grafa. Na začetku so podrobneje razloženi osnovni pojmi teorije grafov, ki so potrebni za razumevanje celotnega dela. V osrednjem delu so opisane lastnosti povezanega dominantnega števila grafa
Smej, Renato
core
The microbiome in human skin aging
FEBS Letters, EarlyView.Age‐related skin changes encompass the well‐known visible phenotypic alterations, together with microbiome dysbiosis and a series of molecular aging hallmarks. These hallmarks characterize not only a fully stablished aged phenotype but also the skin aging process itself.
Manuel Huerta Arana +3 more
wiley +1 more source
Complexity of the game connected domination problem [PDF]
The connected domination game is a variant of the domination game where the played vertices must form a connected subgraph at all stages of the game.
Iršič Chenoweth, Vesna
core +3 more sources