Systematic Analysis of Mycobacterial Acylation Reveals First Example of Acylation-mediated Regulation of Enzyme Activity of a Bacterial Phosphatase

Protein lysine acetylation is known to regulate multiple aspects of bacterial metabolism. However, its presence in mycobacterial signal transduction and virulence-associated proteins has not been studied. In this study, analysis of mycobacterial proteins from different cellular fractions indicated dynamic and widespread occurrence of lysine acetylation. Mycobacterium tuberculosis proteins regulating diverse physiological processes were then selected and expressed in the surrogate host Mycobacterium smegmatis. The purified proteins were analyzed for the presence of lysine acetylation, leading to the identification of 24 acetylated proteins. In addition, novel lysine succinylation and propionylation events were found to co-occur with acetylation on several proteins. Protein-tyrosine phosphatase B (PtpB), a secretory phosphatase that regulates phosphorylation of host proteins and plays a critical role in Mycobacterium infection, is modified by acetylation and succinylation at Lys-224. This residue is situated in a lid region that covers the enzyme's active site. Consequently, acetylation and succinylation negatively regulate the activity of PtpB.

Covalent interlocking of glucose oxidase and peroxidase in the voids of paper: enzyme-polymer ``spider webs''

A modular, general method for trapping enzymes within the voids of paper, without chemical activation of cellulose, is reported. Glucose oxidase and peroxidase were crosslinked with poly(acrylic acid) via carbodiimide chemistry, producing 3-dimensional networks interlocked in cellulose fibers. Interlocking prevented enzyme activity loss and enhanced the washability and stability.

Vacancy-Engineered Nanoceria: Enzyme Mimetic Hotspots for the Degradation of Nerve Agents

Organophosphorus-based nerve agents, such as paraoxon, parathion, and malathion, inhibit acetylcholinesterase, which results in paralysis, respiratory failure, and death. Bacteria are known to use the enzyme phosphotriesterase (PTE) to break down these compounds. In this work, we designed vacancy-engineered nanoceria (VE CeO2 NPs) as PTE mimetic hotspots for the rapid degradation of nerve agents. We observed that the hydrolytic effect of the nano-material is due to the synergistic activity between both Ce3+ and Ce4+ ions located in the active site-like hotspots. Furthermore, the catalysis by nanoceria overcomes the product inhibition generally observed for PTE and small molecule-based PTE mimetics.

Effect of solvents on the enzyme mediated degradation of copolymers

The biodegradation of polycaprolactone (PCL), polylactic acid (PLA), polyglycolide (PGA) and their copolymers, poly (lactide-co-glycolide) and poly (D, L-lactide-co-caprolactone) (PLCL) was investigated. The influence of different solvents on the degradation of these polymers at 37 degrees C in the presence of two different lipases namely Novozym 435 and the free lipase of porcine pancreas was investigated. The rate coefficients for the polymer degradation and enzyme deactivation were determined using continuous distribution kinetics. Among the homopolymers, the degradation of PGA was nearly an order of magnitude lower than that for PCL and PLA. The overall rate coefficients of the copolymers were higher than their respective homopolymers. Thus, PLCL degraded faster than either PCL or PLA. The degradation was highly dependent on the viscosity of the solvent used with the highest degradation observed in acetone. The degradation of the polymers in acetone was nearly twice that observed in dimethyl sulfoxide indicating that the degradation decreases with increase in the solvent viscosity. The degradation of the polymers in water-solvent mixtures indicated an optimal water content of 2.5 wt% of water.

Vacancy-Engineered Nanoceria: Enzyme Mimetic Hotspots for the Degradation of Nerve Agents

Organophosphorus-based nerve agents, such as paraoxon, parathion, and malathion, inhibit acetylcholinesterase, which results in paralysis, respiratory failure, and death. Bacteria are known to use the enzyme phosphotriesterase (PTE) to break down these compounds. In this work, we designed vacancy-engineered nanoceria (VE CeO2 NPs) as PTE mimetic hotspots for the rapid degradation of nerve agents. We observed that the hydrolytic effect of the nano-material is due to the synergistic activity between both Ce3+ and Ce4+ ions located in the active site-like hotspots. Furthermore, the catalysis by nanoceria overcomes the product inhibition generally observed for PTE and small molecule-based PTE mimetics.

Effect of solvents on the enzyme mediated degradation of copolymers

The biodegradation of polycaprolactone (PCL), polylactic acid (PLA), polyglycolide (PGA) and their copolymers, poly (lactide-co-glycolide) and poly (D, L-lactide-co-caprolactone) (PLCL) was investigated. The influence of different solvents on the degradation of these polymers at 37 degrees C in the presence of two different lipases namely Novozym 435 and the free lipase of porcine pancreas was investigated. The rate coefficients for the polymer degradation and enzyme deactivation were determined using continuous distribution kinetics. Among the homopolymers, the degradation of PGA was nearly an order of magnitude lower than that for PCL and PLA. The overall rate coefficients of the copolymers were higher than their respective homopolymers. Thus, PLCL degraded faster than either PCL or PLA. The degradation was highly dependent on the viscosity of the solvent used with the highest degradation observed in acetone. The degradation of the polymers in acetone was nearly twice that observed in dimethyl sulfoxide indicating that the degradation decreases with increase in the solvent viscosity. The degradation of the polymers in water-solvent mixtures indicated an optimal water content of 2.5 wt% of water.

Connecting Active-Site Loop Conformations and Catalysis in Triosephosphate Isomerase: Insights from a Rare Variation at Residue96 in the Plasmodial Enzyme

Despite extensive research into triosephosphate isomerases (TIMs), there exists a gap in understanding of the remarkable conjunction between catalytic loop-6 (residues 166-176) movement and the conformational flip of Glu165 (catalytic base) upon substrate binding that primes the active site for efficient catalysis. The overwhelming occurrence of serine at position96 (98% of the 6277 unique TIM sequences), spatially proximal to E165 and the loop-6 residues, raises questions about its role in catalysis. Notably, Plasmodium falciparum TIM has an extremely rare residuephenylalanineat this position whereas, curiously, the mutant F96S was catalytically defective. We have obtained insights into the influence of residue96 on the loop-6 conformational flip and E165 positioning by combining kinetic and structural studies on the PfTIM F96 mutants F96Y, F96A, F96S/S73A, and F96S/L167V with sequence conservation analysis and comparative analysis of the available apo and holo structures of the enzyme from diverse organisms.

Difference in Enzyme Activity and Conformation of Glucose Oxidase Before and After Purification

EEnzyme activity of commercial glucose oxidase was enhanced after purification through a strong anionic exchange resin. In order to get a better insight into this phenomenon, surface pressure–area ( –A) isotherms and surface pressure–time ( –t) isotherms was used to study the interaction and the absorption at different pH values of the subphases between octadecylamine and glucose oxidase purified by a styrene system quaternary ammonium type strongly basic anionic exchange resin. Circular dichroism (CD), electrophoresis and enzyme activity measurements were conducted to study these phenomena. A preliminary hypothesis has been suggested to explain why the enzyme activity of purified glucose oxidase was higher than that of the commercial one. © 2002 Elsevier Science B.V. All rights reserved.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Diagnosis of invasive candidiasis by enzyme-linked immunosorbent assay using the N-terminal fragment of Candida albicans hyphal wall protein I

Background: The diagnosis of invasive candidiasis is difficult because there are no specific clinical manifestations of the disease and colonization and infection are difficult to distinguish. In the last decade, much effort has been made to develop reliable tests for rapid diagnosis of invasive candidiasis, but none of them have found widespread clinical use. Results: Antibodies against a recombinant N-terminal fragment of the Candida albicans germ tube-specific antigen hyphal wall protein 1 (Hwp1) generated in Escherichia coli were detected by both immunoblotting and ELISA tests in a group of 36 hematological or Intensive Care Unit patients with invasive candidiasis and in a group of 45 control patients at high risk for the mycosis who did not have clinical or microbiological data to document invasive candidiasis. Results were compared with an immunofluorescence test to detect antibodies to C. albicans germ tubes (CAGT). The sensitivity, specificity, positive and negative predictive values of a diagnostic test based on the detection of antibodies against the N-terminal fragment of Hwp1 by immunoblotting were 27.8 %, 95.6 %, 83.3 % and 62.3 %, respectively. Detection of antibodies to the N-terminal fragment of Hwp1 by ELISA increased the sensitivity (88.9 %) and the negative predictive value (90.2 %) but slightly decreased the specificity (82.6 %) and positive predictive values (80 %). The kinetics of antibody response to the N-terminal fragment of Hwp1 by ELISA was very similar to that observed by detecting antibodies to CAGT. Conclusion: An ELISA test to detect antibodies against a recombinant N-terminal fragment of the C. albicans germ tube cell wall antigen Hwp1 allows the diagnosis of invasive candidiasis with similar results to those obtained by detecting antibodies to CAGT but without the need of treating the sera to adsorb the antibodies against the cell wall surface of the blastospore.

Design, specification, and synthesis of aircraft electric power systems control logic

Cyber-physical systems integrate computation, networking, and physical processes. Substantial research challenges exist in the design and verification of such large-scale, distributed sensing, ac- tuation, and control systems. Rapidly improving technology and recent advances in control theory, networked systems, and computer science give us the opportunity to drastically improve our approach to integrated flow of information and cooperative behavior. Current systems rely on text-based spec- ifications and manual design. Using new technology advances, we can create easier, more efficient, and cheaper ways of developing these control systems. This thesis will focus on design considera- tions for system topologies, ways to formally and automatically specify requirements, and methods to synthesize reactive control protocols, all within the context of an aircraft electric power system as a representative application area.

This thesis consists of three complementary parts: synthesis, specification, and design. The first section focuses on the synthesis of central and distributed reactive controllers for an aircraft elec- tric power system. This approach incorporates methodologies from computer science and control. The resulting controllers are correct by construction with respect to system requirements, which are formulated using the specification language of linear temporal logic (LTL). The second section addresses how to formally specify requirements and introduces a domain-specific language for electric power systems. A software tool automatically converts high-level requirements into LTL and synthesizes a controller.

The final sections focus on design space exploration. A design methodology is proposed that uses mixed-integer linear programming to obtain candidate topologies, which are then used to synthesize controllers. The discrete-time control logic is then verified in real-time by two methods: hardware and simulation. Finally, the problem of partial observability and dynamic state estimation is ex- plored. Given a set placement of sensors on an electric power system, measurements from these sensors can be used in conjunction with control logic to infer the state of the system.

Quantum simulation of enzyme catalysis

Separating the dynamics of variables that evolve on different timescales is a common assumption in exploring complex systems, and a great deal of progress has been made in understanding chemical systems by treating independently the fast processes of an activated chemical species from the slower processes that proceed activation. Protein motion underlies all biocatalytic reactions, and understanding the nature of this motion is central to understanding how enzymes catalyze reactions with such specificity and such rate enhancement. This understanding is challenged by evidence of breakdowns in the separability of timescales of dynamics in the active site form motions of the solvating protein. Quantum simulation methods that bridge these timescales by simultaneously evolving quantum and classical degrees of freedom provide an important method on which to explore this breakdown. In the following dissertation, three problems of enzyme catalysis are explored through quantum simulation.

Engineering enzyme systems by recombination

Homologous recombination is a source of diversity in both natural and directed evolution. Standing genetic variation that has passed the test of natural selection is combined in new ways, generating functional and sometimes unexpected changes. In this work we evaluate the utility of homologous recombination as a protein engineering tool, both in comparison with and combined with other protein engineering techniques, and apply it to an industrially important enzyme: Hypocrea jecorina Cel5a.

Chapter 1 reviews work over the last five years on protein engineering by recombination. Chapter 2 describes the recombination of Hypocrea jecorina Cel5a endoglucanase with homologous enzymes in order to improve its activity at high temperatures. A chimeric Cel5a that is 10.1 °C more stable than wild-type and hydrolyzes 25% more cellulose at elevated temperatures is reported. Chapter 3 describes an investigation into the synergy of thermostable cellulases that have been engineered by recombination and other methods. An engineered endoglucanase and two engineered cellobiohydrolases synergistically hydrolyzed cellulose at high temperatures, releasing over 200% more reducing sugars over 60 h at their optimal mixture relative to the best mixture of wild-type enzymes. These results provide a framework for engineering cellulolytic enzyme mixtures for the industrial conditions of high temperatures and long incubation times.

In addition to this work on recombination, we explored three other problems in protein engineering. Chapter 4 describes an investigation into replacing enzymes with complex cofactors with simple cofactors, using an E. coli enolase as a model system. Chapter 5 describes engineering broad-spectrum aldehyde resistance in Saccharomyces cerevisiae by evolving an alcohol dehydrogenase simultaneously for activity and promiscuity. Chapter 6 describes an attempt to engineer gene-targeted hypermutagenesis into E. coli to facilitate continuous in vivo selection systems.

Control of dynamical systems with temporal logic specifications

This thesis is motivated by safety-critical applications involving autonomous air, ground, and space vehicles carrying out complex tasks in uncertain and adversarial environments. We use temporal logic as a language to formally specify complex tasks and system properties. Temporal logic specifications generalize the classical notions of stability and reachability that are studied in the control and hybrid systems communities. Given a system model and a formal task specification, the goal is to automatically synthesize a control policy for the system that ensures that the system satisfies the specification. This thesis presents novel control policy synthesis algorithms for optimal and robust control of dynamical systems with temporal logic specifications. Furthermore, it introduces algorithms that are efficient and extend to high-dimensional dynamical systems.

The first contribution of this thesis is the generalization of a classical linear temporal logic (LTL) control synthesis approach to optimal and robust control. We show how we can extend automata-based synthesis techniques for discrete abstractions of dynamical systems to create optimal and robust controllers that are guaranteed to satisfy an LTL specification. Such optimal and robust controllers can be computed at little extra computational cost compared to computing a feasible controller.

The second contribution of this thesis addresses the scalability of control synthesis with LTL specifications. A major limitation of the standard automaton-based approach for control with LTL specifications is that the automaton might be doubly-exponential in the size of the LTL specification. We introduce a fragment of LTL for which one can compute feasible control policies in time polynomial in the size of the system and specification. Additionally, we show how to compute optimal control policies for a variety of cost functions, and identify interesting cases when this can be done in polynomial time. These techniques are particularly relevant for online control, as one can guarantee that a feasible solution can be found quickly, and then iteratively improve on the quality as time permits.

The final contribution of this thesis is a set of algorithms for computing feasible trajectories for high-dimensional, nonlinear systems with LTL specifications. These algorithms avoid a potentially computationally-expensive process of computing a discrete abstraction, and instead compute directly on the system's continuous state space. The first method uses an automaton representing the specification to directly encode a series of constrained-reachability subproblems, which can be solved in a modular fashion by using standard techniques. The second method encodes an LTL formula as mixed-integer linear programming constraints on the dynamical system. We demonstrate these approaches with numerical experiments on temporal logic motion planning problems with high-dimensional (10+ states) continuous systems.