545 resultados para Acyclic Permutation
Resumo:
Human C5a is a plasma protein with potent chemoattractant and pro-inflammatory properties, and its overexpression correlates with severity of inflammatory diseases. C5a binds to its G protein-coupled receptor (C5aR) on polymorphonuclear leukocytes (PMNLs) through a high-affinity helical bundle and a low-affinity C terminus, the latter being solely responsible for receptor activation. Potent and selective C5a antagonists are predicted to be effective anti-inflammatory drugs, but no pharmacophore for small molecule antagonists has yet been developed, and it would significantly aid drug design. We have hypothesized that a turn conformation is important for activity of the C terminus of C5a and herein report small cyclic peptides that are stable turn mimics with potent antagonism at C5aR on human PMNLs. A comparison of solution structures for the C terminus of C5a, small acyclic peptide ligands, and cyclic antagonists supports the importance of a turn for receptor binding. Competition between a cyclic antagonist and either C5a or an acyclic agonist for C5aR on PMNLs supports a common or overlapping binding site on the C5aR. Structure-activity relationships for 60 cyclic analogs were evaluated by competitive radioligand binding with C5a (affinity) and myeloperoxidase release (antagonist potency) from human PMNLs, with 20 compounds having high antagonist potencies (IC50, 20 nM(-1) muM). Computer modeling comparisons reveal that potent antagonists share a common cyclic backbone shape, with affinity-determining side chains of defined volume projecting from the cyclic scaffold. These results define a new pharmacophore for C5a antagonist development and advance our understanding of ligand recognition and receptor activation of this G protein-coupled receptor.
Resumo:
A major problem in de novo design of enzyme inhibitors is the unpredictability of the induced fit, with the shape of both ligand and enzyme changing cooperatively and unpredictably in response to subtle structural changes within a ligand. We have investigated the possibility of dampening the induced fit by using a constrained template as a replacement for adjoining segments of a ligand. The template preorganizes the ligand structure, thereby organizing the local enzyme environment. To test this approach, we used templates consisting of constrained cyclic tripeptides, formed through side chain to main chain linkages, as structural mimics of the protease-bound extended beta-strand conformation of three adjoining amino acid residues at the N- or C-terminal sides of the scissile bond of substrates. The macrocyclic templates were derivatized to a range of 30 structurally diverse molecules via focused combinatorial variation of nonpeptidic appendages incorporating a hydroxyethylamine transition-state isostere. Most compounds in the library were potent inhibitors of the test protease (HIV-1 protease). Comparison of crystal structures for five protease-inhibitor complexes containing an N-terminal macrocycle and three protease-inhibitor complexes containing a C-terminal macrocycle establishes that the macrocycles fix their surrounding enzyme environment, thereby permitting independent variation of acyclic inhibitor components with only local disturbances to the protease. In this way, the location in the protease of various acyclic fragments on either side of the macrocyclic template can be accurately predicted. This type of templating strategy minimizes the problem of induced fit, reducing unpredictable cooperative effects in one inhibitor region caused by changes to adjacent enzyme-inhibitor interactions. This idea might be exploited in template-based approaches to inhibitors of other proteases, where a beta-strand mimetic is also required for recognition, and also other protein-binding ligands where different templates may be more appropriate.
Resumo:
Consider a network of unreliable links, modelling for example a communication network. Estimating the reliability of the network-expressed as the probability that certain nodes in the network are connected-is a computationally difficult task. In this paper we study how the Cross-Entropy method can be used to obtain more efficient network reliability estimation procedures. Three techniques of estimation are considered: Crude Monte Carlo and the more sophisticated Permutation Monte Carlo and Merge Process. We show that the Cross-Entropy method yields a speed-up over all three techniques.
Resumo:
Motivation: An important problem in microarray experiments is the detection of genes that are differentially expressed in a given number of classes. We provide a straightforward and easily implemented method for estimating the posterior probability that an individual gene is null. The problem can be expressed in a two-component mixture framework, using an empirical Bayes approach. Current methods of implementing this approach either have some limitations due to the minimal assumptions made or with more specific assumptions are computationally intensive. Results: By converting to a z-score the value of the test statistic used to test the significance of each gene, we propose a simple two-component normal mixture that models adequately the distribution of this score. The usefulness of our approach is demonstrated on three real datasets.
Resumo:
CyBase is a curated database and information source for backbone-cyclized proteins. The database incorporates naturally occurring cyclic proteins as well as synthetic derivatives, grafted analogues and acyclic permutants. The database provides a centralized repository of information on all aspects of cyclic protein biology and addresses issues pertaining to the management and searching of topologically circular sequences. The database is freely available at http://research.imb.uq.edu.au/cybase.
Resumo:
The cyclotide family of plant proteins is of interest because of their unique topology, which combines a head-to-tail cyclic backbone with an embedded cystine knot, and because their-remarkable chemical and biological properties make them ideal candidates as grafting templates for biologically active peptide epitopes. The present Study describes the first steps towards exploiting the cyclotide framework by synthesizing and structurally characterizing two grafted analogues of the cyclotide kalata B1. The modified peptides have polar or charged residues substituted for residues that form part of a surface-exposed hydrophobic patch that plays a significant role in the folding and biological activity of kalata B1. Both analogues retain the native cyclotide fold, but lack the undesired haemolytic activity of their parent molecule, kalata B1. This finding confirms the tolerance of the cyclotide framework to residue Substitutions and opens up possibilities for the Substitution of biologically active peptide epitopes into the framework.
Resumo:
The applicability of linear peptides as drugs is potentially limited by their susceptibility to proteolytic cleavage and poor bioavailability. Cyclotides are macrocyclic cystine-knotted mini-proteins that have a broad range of bioactivities and are exceptionally stable, being resistant to chemical, thermal and enzymatic degradation. The general limitations of peptides as drugs can potentially be overcome by using the cyclotide framework as a scaffold onto which new activities may be engineered. The potential use of cyclotides and related peptide scaffolds for drug design is evaluated herein, with reference to increasing knowledge of the structures and sequence diversity of natural cyclotides and the emergence of new approaches in protein engineering.
Resumo:
This thesis describes the design and synthesis of a variety of functionalised phosphine oxides and sulfides, based on the structure of trioctylphosphine oxide, synthesised for the purpose of surface modification of quantum dots. The ability of the ligands to modify the surface chemistry via displacement of the original hexadecylamine capping layer of quantum dots was evaluated. Finally the surface modified quantum dots were investigated for enhancement in their inherent properties and improved compatibility with the various applications for which they were initially designed. Upon the commencement of research involving quantum dots it became apparent that more information on their behaviour and interaction with the environment was required. The limits of the inherent stability of hexadecylamine capped quantum dots were investigated by exposure to a number of different environments. The effect upon the stability of the quantum dots was monitored by changes in the photoluminescence ability of their cores. Subtle differences between different batches of quantum dots were observed and the necessity to account for these in future applications noted. Lastly the displacement of the original hexadecylamine coating with the "designer" functionalised ligands was evaluated to produce a set of conditions that would result in the best possible surface modification. A general procedure was elucidated however it was discovered that each displacement still required slight adjustment by consideration of the other factors such as the difference in ligand structure and the individuality of the various batches of quantum dots. This thesis also describes a procedure for the addition of a protective layer to the surface of quantum dots by cross-linking the functionalised ligands bound to the surface via an acyclic diene metathesis polymerisation. A detailed description of the problems encountered in the analysis of these materials combined with the use of novel techniques such as diffusion ordered spectroscopy is provided as a means to overcome the limitations encountered. Finally a demonstration of the superior stability, upon exposure to a range of aggressive environments of these protected materials compared with those before cross-linking provided physical proof of the cross-linking process and the advantages of the cross-linking modification. Finally this thesis includes the presentation of initial work into the production of luminescent nanocrystal encoded resin beads for the specific use in solid phase combinatorial chemistry. Demonstration of the successful covalent incorporation of quantum dots into the polymeric matrices of non-functionalised and functionalised resin beads is described. Finally by preliminary work to address and overcome the possible limitations that may be encountered in the production and general employment of these materials in combinatorial techniques is given.
Resumo:
The selective conversion of alcohols to their carbonyl derivatives is a critical step towards a sustainable chemical industry. Heterogeneous Pd catalysts represent some of the most active systems known, even so further studies into the active species and role of support are required. Through controlling support mesostructure, using non-interconnected SBA-15 and interlinked SBA-16 and KIT-6, we have evaluated the role of pore architecture on supported Pd nanoparticles and their subsequent activity for liquid phase aerobic allylic alcohol selective oxidation.[1,2] These synthesised silica supports exhibit high surface areas (>800 m2g-1), and similar mesopore diameters (3.5 to 5 nm), but differ in their pore connectivity and arrangement; p6mm (SBA-15), I3mm (SBA-16) and I3ad (KIT-6). When evaluated alongside commercial non-mesoporous silica (200 m2 g-1) they promote enhanced Pd dispersion with interpenetrating assemblies providing further elevation. Macropore introduction into SBA-15, producing a hierarchical macro-mesoporous silica (MM-SBA-15), allows control over mesopore length and accessibility which escalates Pd distribution to levels akin to KIT-6 and SBA-16. Controlling dispersion, and likewise nanoparticle size, is thus facilitated through the choice of support and additionally Pd loading, with cluster sizes spanning 3.2 to 0.8 nm. X-ray spectroscopies indicate nanoparticles are PdO terminated with the oxide content a function of dispersion. Kinetic studies allude to surface PdO being the active site responsible, with a constant TOF observed, independent of loading and support. This confirms activity is governed by PdO density, whilst also overruling internal mass diffusion constraints. MM-SBA-15 facilitates superior activity and TOFs for long chain acyclic terpene alcohols due to reduced internal mass transport constraints.
Resumo:
This paper estimates the importance of (tariff-mediated) network effects and the impact of a consumer's social network on her choice of mobile phone provider. The study uses network data obtained from surveys of students in several European and Asian countries. We use the Quadratic Assignment Procedure, a non-parametric permutation test, to adjust for the particular error structure of network data. We find that respondents strongly coordinate their choice of mobile phone providers, but only if their provider induces network effects. This suggests that this coordination depends on network effects rather than on information contagion or pressure to conform to the social environment.
Resumo:
Pólya’s fundamental enumeration theorem and some results from Williamson’s generalized setup of it are proved in terms of Schur- Macdonald’s theory (S-MT) of “invariant matrices”. Given a permutation group W ≤ Sd and a one-dimensional character χ of W , the polynomial functor Fχ corresponding via S-MT to the induced monomial representation Uχ = ind|Sdv/W (χ) of Sd , is studied. It turns out that the characteristic ch(Fχ ) is the weighted inventory of some set J(χ) of W -orbits in the integer-valued hypercube [0, ∞)d . The elements of J(χ) can be distinguished among all W -orbits by a maximum property. The identity ch(Fχ ) = ch(Uχ ) of both characteristics is a consequence of S-MT, and is equivalent to a result of Williamson. Pólya’s theorem can be obtained from the above identity by the specialization χ = 1W , where 1W is the unit character of W.
Resumo:
Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the job processing times. We find necessary and sufficient conditions (Theorem 1) when there exists a dominant permutation that is optimal for all possible realizations of the job processing times. Our computational studies show the percentage of the problems solvable under these conditions for the cases of randomly generated instances with n ≤ 100 . We also show how to use additional information about the processing times of the completed jobs during optimal realization of a schedule (Theorems 2 – 4). Computational studies for randomly generated instances with n ≤ 50 show the percentage of the two- machine flow-shop scheduling problems solvable under the sufficient conditions given in Theorems 2 – 4.
Resumo:
The purpose of discussed optimal valid partitioning (OVP) methods is uncovering of ordinal or continuous explanatory variables effect on outcome variables of different types. The OVP approach is based on searching partitions of explanatory variables space that in the best way separate observations with different levels of outcomes. Partitions of single variables ranges or two-dimensional admissible areas for pairs of variables are searched inside corresponding families. Statistical validity associated with revealed regularities is estimated with the help of permutation test repeating search of optimal partition for each permuted dataset. Method for output regularities selection is discussed that is based on validity evaluating with the help of two types of permutation tests.
Resumo:
In this paper a genetic algorithm (GA) is applied on Maximum Betweennes Problem (MBP). The maximum of the objective function is obtained by finding a permutation which satisfies a maximal number of betweenness constraints. Every permutation considered is genetically coded with an integer representation. Standard operators are used in the GA. Instances in the experimental results are randomly generated. For smaller dimensions, optimal solutions of MBP are obtained by total enumeration. For those instances, the GA reached all optimal solutions except one. The GA also obtained results for larger instances of up to 50 elements and 1000 triples. The running time of execution and finding optimal results is quite short.
Resumo:
2000 Mathematics Subject Classification: 11T06, 13P10.