Results 61 to 70 of about 3,671,128 (304)

Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling

open access: yesPOS@SAT, 2014
One of the design principles of the state-of-the-art SAT solver Lingeling is to use as compact data structures as possible. These reduce memory usage, increase cache efficiency and thus improve runtime, particularly, when using multiple solver instances ...
Armin Biere
semanticscholar   +1 more source

Cell wall target fragment discovery using a low‐cost, minimal fragment library

open access: yesFEBS Letters, EarlyView.
LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan   +5 more
wiley   +1 more source

SMT Attack: Next Generation Attack on Obfuscated Circuits with Capabilities and Performance Beyond the SAT Attacks

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2018
In this paper, we introduce the Satisfiability Modulo Theory (SMT) attack on obfuscated circuits. The proposed attack is the superset of Satisfiability (SAT) attack, with many additional features.
Kimia Zamiri Azar   +3 more
doaj   +1 more source

The (Glg)ABCs of cyanobacteria: modelling of glycogen synthesis and functional divergence of glycogen synthases in Synechocystis sp. PCC 6803

open access: yesFEBS Letters, EarlyView.
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee   +3 more
wiley   +1 more source

ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver

open access: yesJournal on Satisfiability, Boolean Modeling and Computation, 2014
Branch and bound (BnB) solvers for Max-SAT count at each node of the search tree the number of disjoint inconsistent subsets to compute the lower bound. In the last ten years, important advances have been made regarding the lower bound computation.
André Abramé, Djamal Habet
semanticscholar   +1 more source

Structural biology of ferritin nanocages

open access: yesFEBS Letters, EarlyView.
Ferritin is a conserved iron‐storage protein that sequesters iron as a ferric mineral core within a nanocage, protecting cells from oxidative damage and maintaining iron homeostasis. This review discusses ferritin biology, structure, and function, and highlights recent cryo‐EM studies revealing mechanisms of ferritinophagy, cellular iron uptake, and ...
Eloise Mastrangelo, Flavio Di Pisa
wiley   +1 more source

The planar cell polarity protein Vangl2 interacts with the PDZ‐domains of Scribble but not with a unique PDZ‐like domain in Inturned

open access: yesFEBS Letters, EarlyView.
Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes   +4 more
wiley   +1 more source

Exploiting Resolution-based Representations for MaxSAT Solving

open access: yes, 2015
Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of SAT solvers to identify unsatisfiable subformulas.
A Gelder Van   +16 more
core   +1 more source

Tau acetylation at K331 has limited impact on tau pathology in vivo

open access: yesFEBS Letters, EarlyView.
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto   +3 more
wiley   +1 more source

Strengthening Crypto-1 Cipher Against Algebraic Attacks

open access: yesJournal of ICT Research and Applications, 2015
In the last few years, several studies addressed the problem of data security in Mifare Classic. One of its weaknesses is the low random number quality. This causes SAT solver attacks to have lower complexity.
Farah Afianti, Ari M. Barmawi
doaj   +1 more source

Home - About - Disclaimer - Privacy