Results 111 to 120 of about 1,725,284 (283)
Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank
Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer +7 more
wiley +1 more source
Assessing the impact of algorithmic trading on markets: a simulation approach [PDF]
Innovative automated execution strategies like Algorithmic Trading gain significant market share on electronic market venues worldwide, although their impact on market outcome has not been investigated in depth yet.
Gsell, Markus
core
Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems [PDF]
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a large family ...
Leonid Libkin +3 more
core +1 more source
Algorithmics, Possibilities and Limits of Ordinal Pattern Based Entropies
The study of nonlinear and possibly chaotic time-dependent systems involves long-term data acquisition or high sample rates. The resulting big data is valuable in order to provide useful insights into long-term dynamics.
Albert B. Piek +2 more
doaj +1 more source
Algorithms and Complexity of Difference Logic
This is an strongly extended version of two conference papers with the same authors that appeared at KR 2020 (Title: Fine-Grained Complexity of Temporal Problems) and AAAI 2021 (Title: Disjunctive Temporal Problems under Structural Restrictions)
Dabrowski, K.K. +3 more
openaire +5 more sources
The Shortcut Problem - Complexity and Algorithms
Summary: We study a graph-augmentation problem arising from a technique applied in recent approaches for route planning. Many such methods enhance the graph by inserting shortcuts, i.e., additional edges \((u,v)\) such that the length of \((u,v)\) is the distance from \(u\) to \(v\). Given a weighted, directed graph \(G\) and a number \(c\in \mathbb Z_{
Reinhard Bauer +4 more
openaire +3 more sources
RNA Sequencing Resolves Cryptic Pathogenic Variants in Mitochondrial Disease
ABSTRACT Objective Mitochondrial diseases are the most common inherited metabolic disorders, characterized by pronounced clinical and genetic heterogeneity that complicates molecular diagnosis. Although DNA‐based sequencing approaches have become standard in genetic testing, up to half of patients remain without a definitive diagnosis.
Zhimei Liu +21 more
wiley +1 more source
On Algorithms to Calculate Integer Complexity
8 pages; more details were added for the complexity analysis and a link added to the code on GitHub; minor typos ...
Katherine Cordwell +7 more
openaire +5 more sources
Peripheral Neutrophil Activation and Extracellular Trap Formation in Amyotrophic Lateral Sclerosis
Markers of neutrophil activation are increased in plasma during ALS, and markers of NET formation associate with ALS survival. ABSTRACT Objectives Peripheral neutrophil levels in amyotrophic lateral sclerosis (ALS) inversely correlate with survival, suggesting a role for neutrophils in disease progression.
Lillia A. Baird +9 more
wiley +1 more source
Minimum Initial Marking Estimation in Labeled Petri Nets With Unobservable Transitions
In the literature, researchers have been studying the minimum initial marking (MIM) estimation problem in the labeled Petri nets with observable transitions. This paper extends the results to labeled Petri nets with unobservable transitions (with certain
Keyu Ruan, Lingxi Li, Weimin Wu
doaj +1 more source

