Results 261 to 270 of about 4,856,518 (315)
FEBS Open Bio, EarlyView.Evolutionary analysis across 32 placental mammals identified positive selection at residues H148 and W149 in the immune receptor FcγR1. Ancestral reconstruction combined with molecular dynamics simulations reveals how these mutations may influence receptor structure and dynamics, providing insight into the evolution of antibody recognition and immune ...
David A. Young +7 more
wiley +1 more source
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Acute caffeine treatment protects the developing retina from ischemia‐induced cell death
FEBS Open Bio, EarlyView.Caffeine reduces cell death in the developing retina under ischemia (OGD). This effect does not involve BDNF upregulation or antioxidant pathways (NRF2/VEGF). Neuroprotection occurs mainly through adenosine A2A receptor antagonism, decreasing glutamate release and excitotoxicity, highlighting caffeine's potential as an acute neuroprotective agent in ...
Amanda Alves Nascimento +6 more
wiley +1 more source
FEBS Open Bio, EarlyView.Early‐life exposure to a high‐fat diet altered intact Achilles tendons in rat offspring, making them thinner, stiffer, and molecularly distinct even without injury. These findings suggest that developmental high‐fat diet exposure may impair tendon quality and increase susceptibility to mechanical overload or tendon injury later in life.
Heyong Yin +3 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Hybrid structure: data structuring for data flow
Microprocessing and Microprogramming, 1989Abstract The asynchronous nature of the data flow model of computations allows exploitation of maximum inherent parallelism in many application programs. However, before the data flow model of computations can become a viable alternative to the control flow model of computations, one has to find practical solutions to some major problems such as ...
Ben Lee, Ali R. Hurson
openaire +1 more source
1990
We discuss data structures and their methods of analysis. In particular, we treat the unweighted and weighted dictionary problem, self-organizing data structures, persistent data structures, the union-find-split problem, priority queues, the nearest common ancestor problem, the selection and merging problem, and dynamization techniques.
Mehlhorn, Kurt, Tsakalidis, A.
openaire +3 more sources
We discuss data structures and their methods of analysis. In particular, we treat the unweighted and weighted dictionary problem, self-organizing data structures, persistent data structures, the union-find-split problem, priority queues, the nearest common ancestor problem, the selection and merging problem, and dynamization techniques.
Mehlhorn, Kurt, Tsakalidis, A.
openaire +3 more sources
ACM Transactions on Algorithms, 2007
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present, but also in the past. In this new paradigm, called retroactive data structures , the historical sequence of operations performed on the data structure is not fixed. The data structure allows
Erik D. Demaine +2 more
openaire +5 more sources
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present, but also in the past. In this new paradigm, called retroactive data structures , the historical sequence of operations performed on the data structure is not fixed. The data structure allows
Erik D. Demaine +2 more
openaire +5 more sources
The structure of “data structures”
Proceedings of the ACM '81 conference on - ACM 81, 1981A data structure is defined to be a 4-tuple D, F, S, A>. D and F are Domain and Function definitions which define the externally observable behavior; S and A are a Storage Structure and Algorithms which implement the functions. It is shown that this definition helps organize the field of data structures for presentation to students.
openaire +1 more source
SIAM Journal on Computing, 1988
We consider the problem of answering a series of on-line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data-structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries.
Richard M. Karp +2 more
openaire +1 more source
We consider the problem of answering a series of on-line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data-structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries.
Richard M. Karp +2 more
openaire +1 more source