Results 61 to 70 of about 1,094,599 (317)
FEBS Letters, EarlyView.Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Guy Louchard, Helmut Prodinger
doaj +1 more source
Analysis of concurrent algorithms
DAIMI Report Series, 1981 Analyzing the running time of a concurrent algorithm can be as important as verifying its partial correctness or termination. A simple technique for analyzing the running time of a concurrent algorithm is presented. To analyze an algorithm with concurrent processes, the interaction between the processes must be considered.
openaire +2 more sources
An Algorithmic Analysis of the Intersection Property [PDF]
LMS Journal of Computation and Mathematics, 2004 AbstractIn this paper, efficient algorithms are given to test the intersection property and some of its variations on flag-transitive coset geometries. These algorithms are then applied to geometries of some sporadic groups, namely the Mathieu groups M11, M12, M22and M23, the Janko groups J1, J2and J3 and the Higman-Sims group HS.
Pascale Jacobs, Dimitri Leemans
openaire +3 more sources
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Sequential selection of the k best out of nrankable objects [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The objective of this paper is to find in a setting of n sequential observations of objects a good online policy to select the k bestof these n uniquely rankable objects.
F. Thomas Bruss, Guy Louchard
doaj +1 more source
Analysis of Algorithms: An Example of a Sort Algorithm
Formalized Mathematics, 2013 Summary We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exchanging in terms of program algebra over an algebra.
openaire +2 more sources
Commentary—On Algorithm Analysis [PDF]
INFORMS Journal on Computing, 1996 This is a commentary to the McGeoch's feature article. The objective is to reinforce certain issues and to suggest conceptual framework for future exploration.
openaire +1 more source
Performability analysis: a new algorithm [PDF]
IEEE Transactions on Computers, 1996 Summary: We propose a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the algorithm.
Hédi Nabli, Bruno Sericola
openaire +1 more source
FEBS 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