Results 111 to 120 of about 23,096 (258)

The Shewanella oneidensis Fic enzyme SoFic targets the switch‐I region of EF‐Tu for AMPylation

open access: yesFEBS Letters, EarlyView.
Fic enzymes mediate diverse post‐translational modifications across all domains of life, including AMPylation. Prokaryotic EF‐Tu can be AMPylated and deAMPylated by the conserved Fic enzyme SoFic. Structural and biochemical approaches were used to characterize the effect of AMPylation on EF‐Tu, SoFic's enzymatic activities, and the enzyme‐target ...
Svenja Runge   +6 more
wiley   +1 more source

Periodic descriptor systems: Solvability and conditionability

open access: yes, 1999
The authors consider discrete-time linear periodic descriptor systems and study the concepts of solvability and conditionability, introduced by Luenberger. They prove that solvability is equivalent to conditionability, just as in the time-invariant case.
Sreedhar, J, Van Dooren, Paul
core   +1 more source

Chiral separation of chloroalkanes with the chromatographic column onboard Martian rovers

open access: yesFEBS Letters, EarlyView.
Computer image of the Rosalind Franklin Rover of ESA's ExoMars mission. ExoMars is scheduled to land on planet Mars in Oxia Planum in 2029. This area represents an interesting spot to look for biosignatures. Investigations of ExoMars include measurement on molecular chirality. We show that chiral chloroalkanes, that have been identified on Mars, can be
Asma Merzougui   +4 more
wiley   +1 more source

Ulam–Hyers and Generalized Ulam–Hyers Stability of Fractional Differential Equations with Deviating Arguments

open access: yesMathematics
In this paper, we study the initial value problem for the fractional differential equation with multiple deviating arguments. By using Krasnoselskii’s fixed point theorem, the conditions of solvability of the problem are obtained.
Natalia Dilna   +3 more
doaj   +1 more source

Prospecting the protein design landscape

open access: yesFEBS Letters, EarlyView.
This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona   +4 more
wiley   +1 more source

L‐aspartate oxidase provides new insights into fumarate reduction in anaerobic darkness in Synechocystis sp. PCC6803

open access: yesFEBS Letters, EarlyView.
Synechocystis strains deficient in succinate dehydrogenase (SDH) secrete more succinate than the WT under dark anaerobic conditions, supporting that SDH then primarily acts as SDH, not as a fumarate reductase. L‐aspartate oxidase (Laspo) from Synechocystis is functional under anaerobic conditions, reducing fumarate to succinate.
Kateryna Kukil   +3 more
wiley   +1 more source

Feedback Nash Equilibria for Linear Quadratic Descriptor Differential Games [PDF]

open access: yes
In this note we consider the non-cooperative linear feedback Nash quadratic differential game with an infinite planning horizon for descriptor systems of index one. The performance function is assumed to be indefinite.
Salmah, Y., Engwerda, J.C.
core  

Artificial molecular machines and motors—Design and control of nanoscale motion

open access: yesFEBS Letters, EarlyView.
Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley   +1 more source

The question of solvability

open access: yes, 2003
We give a proof of the Nirenberg-Treves conjecture: that local solvability of principal type pseudodifferential operators is equivalent to condition (Psi).
Dencker, Nils,, Lund University.
core   +1 more source

Call-by-value Solvability

open access: yes, 2002
The notion of solvability in the call-by-value λ-calculus is defined and completely characterized, both from an operational and a logical point of view.
Simona Ronchi Della Rocca, Luca Paolini
core   +1 more source

Home - About - Disclaimer - Privacy