Results 91 to 100 of about 5,110,730 (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
Upper and lower bounds for sums of random variables. [PDF]
In this contribution, the upper bounds for sums of dependent random variables X1 + X2 + … + X n derived by using comonotonicity are sharpened for the case when there exists a random variable Z such that the distribution functions of the Xi, given Z = z ...
Kaas, R, Goovaerts, Marc, Dhaene, Jan
core
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
On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization
, 2008 Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in Pseudo-Boolean Optimization (PBO) algorithms derived from the DPLL procedure for ...
Heras, Federico +5 more
core
Epigenetic reprogramming of lineage switching in cancer
FEBS Letters, EarlyView.Cancer cells rarely commit to a single identity. Epigenetic mechanisms and tumor microenvironment cues push epithelial cells toward flexible, hybrid states that can shift into mesenchymal, neuroendocrine, or stem‐like fates, driving metastasis, drug resistance, and tumor heterogeneity. Targeting the epigenetic regulators behind these transitions, using
Ezgi Boyvatlı +4 more
wiley +1 more source
Lower Bounds for Matrix Product [PDF]
SIAM Journal on Computing, 2001 We prove lower bounds on the number of product gates in bilinear and quadratic circuits that compute the product of two $n \cross n$ matrices over finite fields. In particular we obtain the following results: 1. We show that the number of product gates in any bilinear (or quadratic) circuit that computes the product of two $n \cross n$ matrices over ...
openaire +5 more sources
Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network
FEBS Letters, EarlyView.Golgi enzymes are traditionally considered resident proteins retained within the Golgi apparatus. Here, we demonstrate that a subset transiently reaches the cell surface and is subsequently retrieved to the trans‐Golgi network via retrograde transport. Using a nanobody‐based toolkit, we uncover a dynamic trafficking cycle of several Golgi enzymes.
Dominik P. Buser, Tina Junne
wiley +1 more source
Bounds for the price of discrete arithmetic Asian options. [PDF]
In this paper the pricing of European-style discrete arithmetic Asian options with fixed and floating strike is studied by deriving analytical lower and upper bounds.
Deelstra, G +4 more
core
Известия Иркутского государственного университета: Серия "Математика", 2016 The representations, including polynomial, of functions over final fields have been actively investigated. The complexity of such representations is the main stream of research.
A. Baliuk, A.S. Zinchenko
doaj