Results 251 to 260 of about 42,688,929 (320)

More protein-ligand data are needed for AlphaFold-like models to enable drug discovery. [PDF]

open access: yesCurr Opin Struct Biol
Singh S   +3 more
europepmc   +1 more source

Data Structures

Texts in Computer Science, 2020
S. Skiena
openaire   +2 more sources

Data structures maxima

SIAM Journal on Computing, 1991
Summary: The purpose of this paper is to analyze the maxima properties (value and position) of some data structures. Our theorems concern the distribution of these random variables. Previously known results usually dealt with the mean and sometimes the variance of the random variables. Many of our results rely on diffusion techniques.
Louchard, Guy   +2 more
openaire   +1 more source

Using ggtree to Visualize Data on Tree‐Like Structures

Current Protocols in Bioinformatics, 2020
Ggtree is an R/Bioconductor package for visualizing tree‐like structures and associated data. After 5 years of continual development, ggtree has been evolved as a package suite that contains treeio for tree data input and output, tidytree for tree data ...
Guangchuang Yu
semanticscholar   +1 more source

Designing Far Memory Data Structures: Think Outside the Box

USENIX Workshop on Hot Topics in Operating Systems, 2019
Technologies like RDMA and Gen-Z, which give access to memory outside the box, are gaining in popularity. These technologies provide the abstraction of far memory, where memory is attached to the network and can be accessed by remote processors without ...
M. Aguilera   +3 more
semanticscholar   +1 more source

Data Structures

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

Deferred Data Structuring

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.
Karp, Richard M.   +2 more
openaire   +1 more source

Hybrid structure: data structuring for data flow

Microprocessing and Microprogramming, 1989
Abstract 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 ...
B. Lee, A.R. Hurson
openaire   +1 more source

Efficient Data Structures and Algorithms for Cloud Computing Platforms

2024 4th International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE)
The extensive adoption of cloud computing platforms in storing and processing data have brought forth a new age of efficiency in the way data is stored, processed and managed, requiring new data structures and algorithms that aim to further improve ...
Anbarasu Aladiyan
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy