Results 71 to 80 of about 1,045,743 (273)

Extreme Value distribution for singular measures

open access: yes, 2011
In this paper we perform an analytical and numerical study of Extreme Value distributions in discrete dynamical systems that have a singular measure. Using the block maxima approach described in Faranda et al.
Faranda, Davide   +3 more
core   +3 more sources

C2α‐carbanion‐protonating glutamate discloses tradeoffs between substrate accommodation and reaction rate in actinobacterial 2‐hydroxyacyl‐CoA lyase

open access: yesFEBS Open Bio, EarlyView.
Enzymes of the 2‐hydroxyacyl‐CoA lyase group catalyze the condensation of formyl‐CoA with aldehydes or ketones. Thus, by structural adaptation of active sites, practically any pharmaceutically and industrially important 2‐hydroxyacid could be biotechnologically synthesized. Combining crystal structure analysis, active site mutations and kinetic assays,
Michael Zahn   +4 more
wiley   +1 more source

svt: Singular Value Thresholding in MATLAB

open access: yesJournal of Statistical Software, 2017
Many statistical learning methods such as matrix completion, matrix regression, and multiple response regression estimate a matrix of parameters. The nuclear norm regularization is frequently employed to achieve shrinkage and low rank solutions.
Cai Li, Hua Zhou
doaj   +1 more source

A light‐triggered Time‐Resolved X‐ray Solution Scattering (TR‐XSS) workflow with application to protein conformational dynamics

open access: yesFEBS Open Bio, EarlyView.
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei   +3 more
wiley   +1 more source

Smallest Singular Value for Perturbations of Random Permutation Matrices [PDF]

open access: yes, 2014
We take a first small step to extend the validity of Rudelson-Vershynin type estimates to some sparse random matrices, here random permutation matrices. We give lower (and upper) bounds on the smallest singular value of a large random matrix D+M where M ...
Arous, Gérard Ben, Dang, Kim
core  

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

open access: yesFEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill   +4 more
wiley   +1 more source

Minimizing Communication for Eigenproblems and the Singular Value Decomposition [PDF]

open access: yes, 2010
Algorithms have two costs: arithmetic and communication. The latter represents the cost of moving data, either between levels of a memory hierarchy, or between processors over a network.
Ballard, Grey   +2 more
core   +1 more source

YlmG1 is localized exclusively to the chloroplast envelope membrane and is involved in preprotein translocation in Arabidopsis thaliana

open access: yesFEBS Open Bio, EarlyView.
Cytosolically synthesized chloroplast preproteins are translocated across the outer and inner envelope membranes through translocons called TOC and TIC, respectively. In green algae and plants, the TIC core is composed of essential membrane proteins, Tic12, Tic20, and Tic214.
Mengyi Li, Xueyang Zhao, Masato Nakai
wiley   +1 more source

Detection of Degraded Star Observation Using Singular Values for Improved Attitude Determination

open access: yesSensors
This study introduces an innovative approach aimed at enhancing the accuracy of attitude determination through the computation of star observation quality.
Kiduck Kim
doaj   +1 more source

Randomized Low-Memory Singular Value Projection [PDF]

open access: yes, 2013
Affine rank minimization algorithms typically rely on calculating the gradient of a data error followed by a singular value decomposition at every iteration.
Becker, Stephen   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy