Results 61 to 70 of about 42,373 (259)

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

Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations

open access: yesFEBS Letters, EarlyView.
The putative autism‐associated M65I and S97L variants of the EVH1 domain of the postsynaptic scaffold protein Homer1 do not exhibit substantial changes in their overall structure or partner binding. Both of them, but especially the M65I variant, show altered internal dynamics relative to the wild‐type domain on the μs‐ms timescale, indicated by the ...
Fanni Farkas   +6 more
wiley   +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   +1 more source

An unexpected alternative viologen electron mediator site in tungsten‐containing formate dehydrogenase

open access: yesFEBS Letters, EarlyView.
An unexpected alternative interaction site for ethyl viologen was identified in formate dehydrogenase 1 from Methylorubrum extorquens. Combined mutagenesis, kinetic analysis, and docking revealed that aromatic residues near an iron–sulfur cluster enable flavin mononucleotide‐independent electron transfer, offering a framework for engineering improved ...
Eleni G. Poloniataki, Yong Hwan Kim
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   +4 more sources

Cell geometry and membrane protein crowding constrain Escherichia coli growth rate, overflow metabolism, respiration, and maintenance energy

open access: yesFEBS Letters, EarlyView.
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson   +6 more
wiley   +1 more source

Contamination and comprehensive risk assessment of heavy metals in Liangtan River, Chongqing, China

open access: yesChemical Speciation & Bioavailability, 2016
Distribution and fraction of heavy metals (Pb, Cr, Zn, and Mn) in water and sediment in Liangtan River, Chongqing was analyzed using the atomic absorption spectrometry method.
Lei Wang   +4 more
doaj   +1 more source

Electron transfer between complexes III and IV in S. cerevisiae mitochondrial membranes

open access: yesFEBS Letters, EarlyView.
Mitochondrial oxidative phosphorylation in S. cerevisiae mitoplasts is limited by complex IV catalytic capacity, rather than two‐dimensional cytochrome c diffusion. At physiological cytochrome c : supercomplex ratios at salinity equivalent to that of 20 mm monovalent salt, activity is maximized, indicating that this low ionic strength accurately mimics
Ana Paula Lobez   +2 more
wiley   +1 more source

Where is Bounded Rationality From?

open access: yesAnnals of Business Administrative Science, 2015
“Bounded rationality” has become such a key concept that the mere mention of the name “Simon” calls this phrase to mind. Nonetheless, this phrase does not appear in the original text of Administrative Behavior (Simon, 1947, 1957, 1976, 1997). In spite of
Nobuo TAKAHASHI
doaj   +1 more source

New bounds for the acyclic chromatic index

open access: yesDiscrete Mathematics, 2016
An edge coloring of a graph $G$ is called an acyclic edge coloring if it is proper and every cycle in $G$ contains edges of at least three different colors. The least number of colors needed for an acyclic edge coloring of $G$ is called the acyclic chromatic index of $G$ and is denoted by $a'(G)$.
openaire   +3 more sources

Home - About - Disclaimer - Privacy