995 resultados para general topology
Resumo:
In this paper, we show how interacting and occluding targets can be tackled successfully within a Gaussian approximation. For that purpose, we develop a general expansion of the mean and covariance of the posterior and we consider a first order approximation of it. The proposed method differs from EKF in that neither a non-linear dynamical model nor a non-linear measurement vector to state relation have to be defined, so it works with any kind of interaction potential and likelihood. The approach has been tested on three sequences (10400, 2500, and 400 frames each one). The results show that our approach helps to reduce the number of failures without increasing too much the computation time with respect to methods that do not take into account target interactions.
Resumo:
Computer-assisted topology predictions are widely used to build low-resolution structural models of integral membrane proteins (IMPs). Experimental validation of these models by traditional methods is labor intensive and requires modifications that might alter the IMP native conformation. This work employs oxidative labeling coupled with mass spectrometry (MS) as a validation tool for computer-generated topology models. ·OH exposure introduces oxidative modifications in solvent-accessible regions, whereas buried segments (e.g., transmembrane helices) are non-oxidizable. The Escherichia coli protein WaaL (O-antigen ligase) is predicted to have 12 transmembrane helices and a large extramembrane domain (Pérez et al., Mol. Microbiol. 2008, 70, 1424). Tryptic digestion and LC-MS/MS were used to map the oxidative labeling behavior of WaaL. Met and Cys exhibit high intrinsic reactivities with ·OH, making them sensitive probes for solvent accessibility assays. Overall, the oxidation pattern of these residues is consistent with the originally proposed WaaL topology. One residue (M151), however, undergoes partial oxidation despite being predicted to reside within a transmembrane helix. Using an improved computer algorithm, a slightly modified topology model was generated that places M151 closer to the membrane interface. On the basis of the labeling data, it is concluded that the refined model more accurately reflects the actual topology of WaaL. We propose that the combination of oxidative labeling and MS represents a useful strategy for assessing the accuracy of IMP topology predictions, supplementing data obtained in traditional biochemical assays. In the future, it might be possible to incorporate oxidative labeling data directly as constraints in topology prediction algorithms.
Resumo:
WecA is an integral membrane protein that initiates the biosynthesis of enterobacterial common antigen and O-antigen lipopolysaccharide (LPS) by catalyzing the transfer of N-acetylglucosamine (GlcNAc)-1-phosphate onto undecaprenyl phosphate (Und-P) to form Und-P-P-GlcNAc. WecA belongs to a large family of eukaryotic and prokaryotic prenyl sugar transferases. Conserved aspartic acids in putative cytoplasmic loops 2 (Asp90 and Asp91) and 3 (Asp156 and Asp159) were targeted for replacement mutagenesis with either glutamic acid or asparagine. We examined the ability of each mutant protein to complement O-antigen LPS synthesis in a wecA-deficient strain and also determined the steady-state kinetic parameters of the mutant proteins in an in vitro transfer assay. Apparent K(m) and V(max) values for UDP-GlcNAc, Mg(2+), and Mn(2+) suggest that Asp156 is required for catalysis, while Asp91 appears to interact preferentially with Mg(2+), possibly playing a role in orienting the substrates. Topological analysis using the substituted cysteine accessibility method demonstrated the cytosolic location of Asp90, Asp91, and Asp156 and provided a more refined overall topological map of WecA. Also, we show that cells expressing a WecA derivative C terminally fused with the green fluorescent protein exhibited a punctate distribution of fluorescence on the bacterial surface, suggesting that WecA localizes to discrete regions in the bacterial plasma membrane.
Resumo:
Members of the Burkholderia cepacia complex can secrete proteases, lipases, and hemolysins. We report in this study the identification of a general secretory pathway present in a B. vietnamiensis (formerly genomovar V) clinical isolate, which is required for the efficient secretion of phospholipase C and hemolysin activities. Southern blot hybridization experiments revealed that this general secretion pathway is highly conserved among the different genomovars of the B. cepacia complex and is homologous to a similar system described in B. pseudomallei. We also show that this pathway appears not to be necessary for intracellular survival of B. vietnamiensis within Acanthamoeba polyphaga.
Resumo:
The ideal free distribution model which relates the spatial distribution of mobile consumers to that of their resource is shown to be a limiting case of a more general model which we develop using simple concepts of diffusion. We show how the ideal free distribution model can be derived from a more general model and extended by incorporating simple models of social influences on predator spacing. First, a free distribution model based on patch switching rules, with a power-law interference term, which represents instantaneous biased diffusion is derived. A social bias term is then introduced to represent the effect of predator aggregation on predator fitness, separate from any effects which act through intake rate. The social bias term is expanded to express an optimum spacing for predators and example solutions of the resulting biased diffusion models are shown. The model demonstrates how an empirical interference coefficient, derived from measurements of predator and prey densities, may include factors expressing the impact of social spacing behaviour on fitness. We conclude that empirical values of log predator/log prey ratio may contain information about more than the relationship between consumer and resource densities. Unlike many previous models, the model shown here applies to conditions without continual input. (C) 1997 Academic Press Limited.</p>
Resumo:
The prevalence of multicore processors is bound to drive most kinds of software development towards parallel programming. To limit the difficulty and overhead of parallel software design and maintenance, it is crucial that parallel programming models allow an easy-to-understand, concise and dense representation of parallelism. Parallel programming models such as Cilk++ and Intel TBBs attempt to offer a better, higher-level abstraction for parallel programming than threads and locking synchronization. It is not straightforward, however, to express all patterns of parallelism in these models. Pipelines are an important parallel construct, although difficult to express in Cilk and TBBs in a straightfor- ward way, not without a verbose restructuring of the code. In this paper we demonstrate that pipeline parallelism can be easily and concisely expressed in a Cilk-like language, which we extend with input, output and input/output dependency types on procedure arguments, enforced at runtime by the scheduler. We evaluate our implementation on real applications and show that our Cilk-like scheduler, extended to track and enforce these dependencies has performance comparable to Cilk++.