Results 91 to 100 of about 4,363,442 (260)
On global (strong) defensive alliances in some product graphs
Communications in Combinatorics and Optimization, 2017 A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one more neighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The
Ismael Gonz\'alez Yero +2 more
doaj +1 more source
Time after time – circadian clocks through the lens of oscillator theory
FEBS Letters, EarlyView.Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source
On products of strong Skolem starters
Journal of Combinatorial DesignsAbstractIn 1991, Shalaby conjectured that any , where or , admits a strong Skolem starter. In 2018, the authors fully described and explicitly constructed the infinite “cardioidal” family of strong Skolem starters. No other infinite family of these combinatorial designs was known to date.
Oleg Ogandzhanyants +2 more
openaire +3 more sources
Multiple ETS family transcription factors bind mutant p53 via distinct interaction regions
FEBS Letters, EarlyView.Mutant p53 gain‐of‐function is thought to be mediated by interaction with other transcription factors. We identify multiple ETS transcription factors that can bind mutant p53 and found that this interaction can be promoted by a PXXPP motif. ETS proteins that strongly bound mutant p53 were upregulated in ovarian cancer compared to ETS proteins that ...
Stephanie A. Metcalf +6 more
wiley +1 more source
Bounding the Open k-Monopoly Number of Strong Product Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G = (V, E) be a simple graph without isolated vertices and minimum degree δ, and let k ∈ {1 − ⌈δ/2⌉, . . . , ⌊δ/2⌋} be an integer. Given a set M ⊂ V, a vertex v of G is said to be k-controlled by M if δM(v)≥δG(v)2+k$\delta _M (v) \ge {{\delta _G (v)}
Kuziak Dorota +2 more
doaj +1 more source
Solving Strong-Substitutes Product-Mix Auctions
Mathematics of Operations ResearchThis paper develops algorithms to solve strong-substitutes product-mix auctions: it finds competitive equilibrium prices and quantities for agents who use this auction’s bidding language to truthfully express their strong-substitutes preferences over an arbitrary number of goods, each of which is available in multiple discrete units.
Elizabeth Baldwin +3 more
openaire +4 more sources
The newfound relationship between extrachromosomal DNAs and excised signal circles
FEBS Letters, EarlyView.Extrachromosomal DNAs (ecDNAs) contribute to the progression of many human cancers. In addition, circular DNA by‐products of V(D)J recombination, excised signal circles (ESCs), have roles in cancer progression but have largely been overlooked. In this Review, we explore the roles of ecDNAs and ESCs in cancer development, and highlight why these ...
Dylan Casey, Zeqian Gao, Joan Boyes
wiley +1 more source
Market Size, Competition, and the Product Mix of Exporters [PDF]
We build a theoretical model of multi-product firms that highlights how market size and geography (the market sizes of and bilateral economic distances to trading partners) affect both a firm\'s ex-ported product range and its exported product mix across
Gianmarco I.P. Ottaviano +2 more
core
FEBS Letters, EarlyView.Cryptochrome and PAS/LOV proteins play intricate roles in circadian clocks where they act as both sensors and mediators of protein–protein interactions. Their ubiquitous presence in signaling networks has positioned them as targets for small‐molecule therapeutics. This review provides a structural introduction to these protein families.
Eric D. Brinckman +2 more
wiley +1 more source
On the strong metric generators of strong product graphs
, 2013 12 ...
Kuziak, Dorota +2 more
openaire +2 more sources