862 resultados para COMBINATORIAL TECHNOLOGIES
Resumo:
We study the kinetics of the biomolecular binding process at the interface using energy landscape theory. The global kinetic connectivity case is considered for a downhill funneled energy landscape. By solving the kinetic master equation, the kinetic time for binding is obtained and shown to have a U-shape curve-dependence on the temperature. The kinetic minimum of the binding time monotonically decreases when the ratio of the underlying energy gap between native state and average non-native states versus the roughness or the fluctuations of the landscape increases. At intermediate temperatures,fluctuations measured by the higher moments of the binding time lead to non-Poissonian, non-exponential kinetics. At both high and very low temperatures, the kinetics is nearly Poissonian and exponential.
Resumo:
Biomolecular recognition often involves large conformational changes, sometimes even local unfolding. The identification of kinetic pathways has become a central issue in understanding the nature of binding. A new approach is proposed here to study the dynamics of this binding-folding process through the establishment of a path-integral framework on the underlying energy landscape. The dominant kinetic paths of binding and folding can be determined and quantified. The significant coupling between the binding and folding of biomolecules often exists in many important cellular processes. In this case, the corresponding kinetic paths of binding are shown to be intimately correlated with those of folding and the dynamics becomes quite cooperative. This implies that binding and folding happen concurrently. When the coupling between binding and folding is weak (strong), the kinetic process usually starts with significant folding (binding) first, with the binding (folding) later proceeding to the end. The kinetic rate can be obtained through the contributions from the dominant paths. The rate is shown to have a bell-shaped dependence on temperature in the concentration-saturated regime consistent with experiment. The changes of the kinetics that occur upon changing the parameters of the underlying binding-folding energy landscape are studied.
Resumo:
Production scheduling in a flexible manufacturing system (FMS) is a real-time combinatorial optimization problem that has been proved to be NP-complete. Solving this problem needs on-line monitoring of plan execution and requires real-time decision-making in selecting alternative routings, assigning required resources, and rescheduling when failures occur in the system. Expert systems provide a natural framework for solving this kind of NP-complete problems.In this paper an expert system with a novel parallel heuristic approach is implemented for automatic short-term dynamic scheduling of FMS. The principal features of the expert system presented in this paper include easy rescheduling, on-line plan execution, load balancing, an on-line garbage collection process, and the use of advanced knowledge representational schemes. Its effectiveness is demonstrated with two examples.
Resumo:
Combinatorial Optimization is becoming ever more crucial, in these days. From natural sciences to economics, passing through urban centers administration and personnel management, methodologies and algorithms with a strong theoretical background and a consolidated real-word effectiveness is more and more requested, in order to find, quickly, good solutions to complex strategical problems. Resource optimization is, nowadays, a fundamental ground for building the basements of successful projects. From the theoretical point of view, Combinatorial Optimization rests on stable and strong foundations, that allow researchers to face ever more challenging problems. However, from the application point of view, it seems that the rate of theoretical developments cannot cope with that enjoyed by modern hardware technologies, especially with reference to the one of processors industry. In this work we propose new parallel algorithms, designed for exploiting the new parallel architectures available on the market. We found that, exposing the inherent parallelism of some resolution techniques (like Dynamic Programming), the computational benefits are remarkable, lowering the execution times by more than an order of magnitude, and allowing to address instances with dimensions not possible before. We approached four Combinatorial Optimization’s notable problems: Packing Problem, Vehicle Routing Problem, Single Source Shortest Path Problem and a Network Design problem. For each of these problems we propose a collection of effective parallel solution algorithms, either for solving the full problem (Guillotine Cuts and SSSPP) or for enhancing a fundamental part of the solution method (VRP and ND). We endorse our claim by presenting computational results for all problems, either on standard benchmarks from the literature or, when possible, on data from real-world applications, where speed-ups of one order of magnitude are usually attained, not uncommonly scaling up to 40 X factors.
Resumo:
Vaccinology is a combinatorial science which studies the diversity of pathogens and the human immune system, and formulations that can modulate immune responses and prevent or cure disease. Huge amounts of data are produced by genomics and proteomics projects and large-scale screening of pathogen-host and antigen-host interactions. Current developments in computational vaccinology mainly support the analysis of antigen processing and presentation and the characterization of targets of immune response. Future development will also include systemic models of vaccine responses. Immunomics, the large-scale screening of immune processes which includes powerful immunoinformatic tools, offers great promise for future translation of basic immunology research advances into successful vaccines.
Resumo:
We have successfully linked protein library screening directly with the identification of active proteins, without the need for individual purification, display technologies or physical linkage between the protein and its encoding sequence. By using 'MAX' randomization we have rapidly constructed 60 overlapping gene libraries that encode zinc finger proteins, randomized variously at the three principal DNA-contacting residues. Expression and screening of the libraries against five possible target DNA sequences generated data points covering a potential 40,000 individual interactions. Comparative analysis of the resulting data enabled direct identification of active proteins. Accuracy of this library analysis methodology was confirmed by both in vitro and in vivo analyses of identified proteins to yield novel zinc finger proteins that bind to their target sequences with high affinity, as indicated by low nanomolar apparent dissociation constants.
Resumo:
Mucobromic and mucochloric acid were used as building blocks for the construction of a chemical combinatorial library of 3,4,5-trisubstituted 2(5H)-furanones. With these 2 butenolide building blocks, and eight alcohols a sublibrary of 16 dihalogenated 5-alkoxy-2(5H)-furanones was prepared. This sublibrary of 5-alkoxylated furanones was reacted with 16 amines generating a full size focussed combinatorial library of 256 individual compounds. This three dimensional combinatorial library of 3-halogen-4-amino-5-alkoxy-2(5H)-furanones was prepared around the benzimidazolyl furanone lead structure by applying a solution phase combinatorial chemistry concept. Typical representatives of the library were purified and fully characterized and one x-ray structures was recorded, additionally. The 3-bromo-4-benzimizazolyl-5-methoxy-2(5H)furanone, Br-A-l, showed an MIC of 8 μg/ml against the multiresistant Staphylococcus aureus ( MRSA). © 2006 Bentham Science Publishers Ltd.