Results 71 to 80 of about 4,511,459 (292)

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements [PDF]

open access: yes, 2014
We consider degree bounded network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph G = (V, E) with weights w(e) on the edges and degree ...
Ali Vakilian   +3 more
core   +1 more source

Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation

open access: yesFEBS 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

Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry

open access: yesFEBS Letters, EarlyView.
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri   +5 more
wiley   +1 more source

Ball exhaustion of the Reinhardt domain: properties of analytic functions of bounded $\mathbf{L}$-index in joint variables

open access: yesМатематичні Студії
This article is a continuation of the research on the concept of an analytic function of a bounded $\mathbf{L}$-index, conducted during 2019-2025 in the articles A. Bandura, T. Salo and O.
A. I. Bandura   +2 more
doaj   +1 more source

Boundedness of l-index of analytic curves [PDF]

open access: yesМатематичні Студії, 2011
We introduce a concept of an analytic curve of bounded l-index and investigate possible growth of such curves. Moreover, l-index boundedness of analytic curves satisfying linear differential equations is investigated.
M. T. Bordulyak, M. M. Sheremeta
doaj  

Translophagy—A potential link between autophagy impairment and translational errors

open access: yesFEBS Letters, EarlyView.
Neurodegenerative diseases are characterised by the accumulation of abnormal proteins and protein aggregates, but their origin often remains unknown. We propose that selective autophagy removes damaged protein‐making machinery, preventing errors during protein synthesis.
Mykola V. Korolchuk   +11 more
wiley   +1 more source

On Set-Valued Complementarity Problems

open access: yesAbstract and Applied Analysis, 2013
This paper investigates the set-valued complementarity problems (SVCP) which poses rather different features from those that classical complementarity problems hold, due to tthe fact that he index set is not fixed, but dependent on .
Jinchuan Zhou   +2 more
doaj   +1 more source

Lower bounds for Estrada index and Laplacian Estrada index

open access: yesApplied Mathematics Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hamidreza Bamdad   +2 more
openaire   +3 more sources

Functional comparison of EncB and EncC cargo proteins in iron storage within the Myxococcus xanthus encapsulin

open access: yesFEBS Letters, EarlyView.
Encapsulins are protein nanocompartments that play an important role in iron storage. In the Myxococcus xanthus encapsulin system, two cargo proteins called EncB and EncC contribute to iron mineralization. Here, we show that EncB and EncC generate iron‐containing minerals with distinct chemical compositions, suggesting that the composition of stored ...
Harry B. McDowell   +2 more
wiley   +1 more source

Improving upper bounds for the distinguishing index

open access: yesArs Mathematica Contemporanea, 2017
Summary: The distinguishing index of a graph \(G\), denoted by \(D^\prime(G)\), is the least number of colours in an edge colouring of \(G\) not preserved by any non-trivial automorphism. We characterize all connected graphs \(G\) with \(D^\prime(G)\geq \Delta(G)\).
openaire   +5 more sources

Home - About - Disclaimer - Privacy