Results 61 to 70 of about 3,355,376 (309)
An overview on polynomial approximation of NP-hard problems [PDF]
Yugoslav Journal of Operations Research, 2009 The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between
Paschos Vangelis Th.
doaj +1 more source
Emerging experimental and computational methods for studying redox‐regulated structural transitions
FEBS Letters, EarlyView.Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source
Frontiers in ImmunologyBreast cancer, characterized by its complexity and diversity, presents significant challenges in understanding its underlying biology. In this study, we employed gene co-expression network analysis to investigate the gene composition and functional ...
Tadeo Enrique Velazquez-Caldelas +3 more
doaj +1 more source
Lower Bound on Weights of Large Degree Threshold Functions [PDF]
Logical Methods in Computer Science, 2013 An integer polynomial $p$ of $n$ variables is called a \emph{threshold gate} for a Boolean function $f$ of $n$ variables if for all $x \in \zoon$ $f(x)=1$ if and only if $p(x)\geq 0$.
Vladimir V. Podolskii
doaj +1 more source
Complexity in Scalable Computing [PDF]
Scientific Programming, 2008 The rich history of scalable computing research owes much to a rapid rise in computing platform scale in terms of size and speed. As platforms evolve, so must algorithms and the software expressions of those algorithms. Unbridled growth in scale inevitably leads to complexity.
openaire +1 more source
FEBS Letters, EarlyView.Encapsulins are protein nanocompartments that play an important role in iron storage. In the Myxococcus xanthus encapsulin system, two cargo proteins called EncB and EncC contribute to iron mineralization. Here, we show that EncB and EncC generate iron‐containing minerals with distinct chemical compositions, suggesting that the composition of stored ...
Harry B. McDowell +2 more
wiley +1 more source
Computational complexity of functions
Theoretical Computer Science, 1996 Partial translation from [Levin 74]; preliminary version is in [Levin 73]
openaire +4 more sources
The Complexity of Stratification Computation [PDF]
Discrete & Computational Geometry, 1998 The paper studies the complexity of an algorithm that stratifies semialgebraic sets. It gives a general theorem on the complexity of an algorithm which constructs a stratification for a wide class of conditions, called here admissible. The algorithm is doubly exponential in the depth of the stratification.
openaire +2 more sources
The Shewanella oneidensis Fic enzyme SoFic targets the switch‐I region of EF‐Tu for AMPylation
FEBS Letters, EarlyView.Fic enzymes mediate diverse post‐translational modifications across all domains of life, including AMPylation. Prokaryotic EF‐Tu can be AMPylated and deAMPylated by the conserved Fic enzyme SoFic. Structural and biochemical approaches were used to characterize the effect of AMPylation on EF‐Tu, SoFic's enzymatic activities, and the enzyme‐target ...
Svenja Runge +6 more
wiley +1 more source
Complexity, Governance and Networks: Introduction to the Inaugural Issue
, 2014 From the introduction: 1. Yet Another Journal? Why is it necessary to publish a new journal about complexity, governance, and networks? There has been an increasing interest in complexity, governance, and network studies in recent decades.
Morçöl, Göktuğ +2 more
core +1 more source