Results 351 to 360 of about 119,051 (375)
Some of the next articles are maybe not open access.
[23] Endopeptidase Clp: ATP-dependent Clp protease from Escherichia coli
1994Publisher Summary Escherichia coli Clp protease is a multicomponent protease that has an adenosine triphosphate (ATP)-activated proteolytic activity and an ATPase activity that is activated by proteins and peptides. This chapter describes purification and properties of two components of Clp protease—namely, ClpP and ClpA.
Mark W. Thompson +3 more
openaire +3 more sources
ATP-promoted interaction between Clp A and Clp P in activation of Clp protease from Escherichia coli
Biochemical Society Transactions, 1991Summary Clp protease is a high relative molecular mass, ATP-dependent protease found in the cytoplasm of Escherichia coli. Clp protease is composed of two protein components, Clp A, which has ATPase activity, and Clp P, which has the proteolytic active site and is activated by Clp A in the presence of ATP.
openaire +3 more sources
1994
The epoch of the 1990’s has proclaimed the need for documenting and recording information in nearly every category of endeavor: business, health care, teaching, government. This demand necessitates a move toward creating computerized database systems to collect, aggregate, and transform pertinent data into usable information.
James J. Strain, Jeffrey S. Hammer
openaire +2 more sources
The epoch of the 1990’s has proclaimed the need for documenting and recording information in nearly every category of endeavor: business, health care, teaching, government. This demand necessitates a move toward creating computerized database systems to collect, aggregate, and transform pertinent data into usable information.
James J. Strain, Jeffrey S. Hammer
openaire +2 more sources
Intelligent backtracking in CLP(ℜ)
Annals of Mathematics and Artificial Intelligence, 1996CLP(ℜ) is a constraint logic programming language in which constraints can be expressed in the domain of real numbers. Computation in this specialized domain gives access to information useful in intelligent backtracking. In this paper, we present an efficient constraint satisfaction algorithm for linear constraints in the real number domain and show ...
Burg, Jennifer J. +2 more
openaire +3 more sources
Physiologia Plantarum : An International Journal for Plant Biology, 2012
The ATP-dependent Clp protease is by far the most intricate protease in chloroplasts of vascular plants. Structurally, it is particularly complex with a proteolytic core complex containing 11 distinct subunits along with three potential chaperone ...
A. Clarke
semanticscholar +1 more source
The ATP-dependent Clp protease is by far the most intricate protease in chloroplasts of vascular plants. Structurally, it is particularly complex with a proteolytic core complex containing 11 distinct subunits along with three potential chaperone ...
A. Clarke
semanticscholar +1 more source
There's many a CLP on the path to B
Blood, 2010Lymphocyte development is an excellent model system to study cell fate choices and the underlying transcriptional mechanisms. However, the earliest events have been poorly understood, due in part to the rarity of the relevant cellular intermediates. In this issue of Blood , Mansson and colleagues identify several subsets within the CLP and fraction A ...
J. Jeremiah Bell, Avinash Bhandoola
openaire +3 more sources
CLP and constraint abstraction
Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89, 1989CLP*(D) is a class of constraint logic programming languages which incorporates the notion of abstraction. Predicates in CLP*(D) are (potentially) infinite rational trees which represent abstractions of constraint expressions. This view of predicates as constraint abstractions was motivated by the language Scheme, where closures are viewed as ...
openaire +2 more sources
Representing Multi-agent Planning in CLP
2009We explore the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning domains in presence of multiple interacting agents. We develop a novel constraint-based action language, $\mathcal{B}^{\sf MAP}$, that enables the declarative description of large classes of multi-agent and multi-valued domains. $\mathcal{B}^{\sf MAP}$
DOVIER, Agostino +2 more
openaire +3 more sources
2004
The framework presented in the previous chapters shows how the soft constraint idea can give us an easy way to model non-crisp problems. To program applications we need, nevertheless, a language where we can use soft constraints. This is why we extend the Constraint Logic Programming (CLP) formalism in order to handle semiring-based constraints.
openaire +2 more sources
The framework presented in the previous chapters shows how the soft constraint idea can give us an easy way to model non-crisp problems. To program applications we need, nevertheless, a language where we can use soft constraints. This is why we extend the Constraint Logic Programming (CLP) formalism in order to handle semiring-based constraints.
openaire +2 more sources
Symbolic Execution of Concurrent Objects in CLP
2012In the concurrent objects model, objects have conceptually dedicated processors and live in a distributed environment with unordered communication by means of asynchronous method calls. Method callers may decide at runtime when to synchronize with the reply from a call.
Albert E., Arenas P., Gomez-Zamalloa M.
openaire +2 more sources