Glutathione Transferases as Detoxification Agents: Structural and Functional Studies

Glutathione transferases (GSTs) are a diverse family of enzymes that catalyze the glutathione-dependent detoxification of toxic compounds. GSTs are responsible for the conjugation of the tripeptide glutathione (GSH) to a wide range of electrophilic substrates. These include industrial pollutants, drugs, genotoxic carcinogen metabolites, antibiotics, insecticides and herbicides. In light of applications in biomedicine and biotechnology as cellular detoxification agents, detailed structural and functional studies of GSTs are required. Plant tau class GSTs play crucial catalytic and non-catalytic roles in cellular xenobiotic detoxification process in agronomically important crops. The abundant existence of GSTs in Glycine max and their ability to provide resistance to abiotic and biotic stresses such as herbicide tolerance is of great interest in agriculture because they provide effective and suitable tools for selective weed control. Structural and catalytic studies on tau class GST isoenzymes from Glycine max (GmGSTU10-10, GmGSTU chimeric clone 14 (Sh14), and GmGSTU2-2) were performed. Crystal structures of GmGSTU10-10 in complex with glutathione sulfenic acid (GSOH) and Sh14 in complex with S-(p-nitrobenzyl)-glutathione (Nb-GSH) were determined by molecular replacement at 1.6 Å and 1.75 Å, respectively. Major structural variations that affect substrate recognition and catalytic mechanism were revealed in the upper part of helix H4 and helix H9 of GmGSTU10-10. Structural analysis of Sh14 showed that the Trp114Cys point mutation is responsible for the enhanced catalytic activity of the enzyme. Furthermore, two salt bridges that trigger an allosteric effect between the H-sites were identified at the dimer interface between Glu66 and Lys104. The 3D structure of GmGSTU2-2 was predicted using homology modeling. Structural and phylogenetic analysis suggested GmGSTU2-2 shares residues that are crucial for the catalytic activity of other tau class GSTs–Phe10, Trp11, Ser13, Arg20, Tyr30, Leu37, Lys40, Lys53, Ile54, Glu66 and Ser67. This indicates that the catalytic and ligand binding site in GmGSTU2-2 are well-conserved. Nevertheless, at the ligandin binding site a significant variation was observed. Tyr32 is replaced by Ser32 in GmGSTU2-2 and thismay affect the ligand recognition and binding properties of GmGSTU2-2. Moreover, docking studies revealed important amino acid residues in the hydrophobic binding site that can affect the substrate specificity of the enzyme. Phe10, Pro12, Phe15, Leu37, Phe107, Trp114, Trp163, Phe208, Ile212, and Phe216 could form the hydrophobic ligand binding site and bind fluorodifen. Additionally, side chains of Arg111 and Lys215 could stabilize the binding through hydrogen bonds with the –NO2 groups of fluorodifen. GST gene family from the pathogenic soil bacterium Agrobacterium tumefaciens C58 was characterized and eight GST-like proteins in A. tumefaciens (AtuGSTs) were identified. Phylogenetic analysis revealed that four members of AtuGSTs belong to a previously recognized bacterial beta GST class and one member to theta class. Nevertheless, three AtuGSTs do not belong to any previously known GST classes. The 3D structures of AtuGSTs were predicted using homology modeling. Comparative structural and sequence analysis of the AtuGSTs showed local sequence and structural characteristics between different GST isoenzymes and classes. Interactions at the G-site are conserved, however, significant variations were seen at the active site and the H5b helix at the C-terminal domain. H5b contributes to the formation of the hydrophobic ligand binding site and is responsible for recognition of the electrophilic moiety of the xenobiotic. It is noted that the position of H5b varies among models, thus providing different specificities. Moreover, AtuGSTs appear to form functional dimers through diverse modes. AtuGST1, AtuGST3, AtuGST4 and AtuGST8 use hydrophobic ‘lock–and–key’-like motifs whereas the dimer interface of AtuGST2, AtuGST5, AtuGST6 and AtuGST7 is dominated by polar interactions. These results suggested that AtuGSTs could be involved in a broad range of biological functions including stress tolerance and detoxification of toxic compounds.

Design and validation of a novel generic platform for the production of tetravalent IgG1-like bispecific antibodies

International audience

Insights into the Specificity of Thioredoxin Reductase-Thioredoxin Interactions. A Structural and Functional Investigation of the Yeast Thioredoxin System

The enzymatic activity of thioredoxin reductase enzymes is endowed by at least two redox centers: a flavin and a dithiol/disulfide CXXC motif. The interaction between thioredoxin reductase and thioredoxin is generally species-specific, but the molecular aspects related to this phenomenon remain elusive. Here, we investigated the yeast cytosolic thioredoxin system, which is composed of NADPH, thioredoxin reductase (ScTrxR1), and thioredoxin 1 (ScTrx1) or thioredoxin 2 (ScTrx2). We showed that ScTrxR1 was able to efficiently reduce yeast thioredoxins (mitochondrial and cytosolic) but failed to reduce the human and Escherichia coli thioredoxin counterparts. To gain insights into this specificity, the crystallographic structure of oxidized ScTrxR1 was solved at 2.4 angstrom resolution. The protein topology of the redox centers indicated the necessity of a large structural rearrangement for FAD and thioredoxin reduction using NADPH. Therefore, we modeled a large structural rotation between the two ScTrxR1 domains (based on the previously described crystal structure, PDB code 1F6M). Employing diverse approaches including enzymatic assays, site-directed mutagenesis, amino acid sequence alignment, and structure comparisons, insights were obtained about the features involved in the species-specificity phenomenon, such as complementary electronic parameters between the surfaces of ScTrxR1 and yeast thioredoxin enzymes and loops and residues (such as Ser(72) in ScTrx2). Finally, structural comparisons and amino acid alignments led us to propose a new classification that includes a larger number of enzymes with thioredoxin reductase activity, neglected in the low/high molecular weight classification.

Molecular biology of prolactin and prolactin receptor in a marine teleost: the sea bream(Sparus aurata)

Tese de dout. em Biologia, especialidade de Biologia Molecular, Unidade de Ciências e Tecnologias dos Recursos Aquáticos, Univ. do Algarve

The estimation of statistical parameters for local alignment score distributions

The distribution of optimal local alignment scores of random sequences plays a vital role in evaluating the statistical significance of sequence alignments. These scores can be well described by an extreme-value distribution. The distribution’s parameters depend upon the scoring system employed and the random letter frequencies; in general they cannot be derived analytically, but must be estimated by curve fitting. For obtaining accurate parameter estimates, a form of the recently described ‘island’ method has several advantages. We describe this method in detail, and use it to investigate the functional dependence of these parameters on finite-length edge effects.

Genome Survey Sequence Analysis and Identification of Homologs of Major Surface Protease (gp63) Genes in Trypanosoma rangeli

In this study, 222 genome survey sequences were generated for Trypanosoma rangeli strain P07 isolated from an opossum (Didelphis albiventris) in Minas Gerais State, Brazil. T. rangeli sequences were compared by BLASTX (Basic Local Alignment Search Tool X) analysis with the assembled contigs of Leishmania braziliensis, Leishmania infantum, Leishmania major, Trypanosoma brucei, and Trypanosoma cruzi. Results revealed that 82% (182/222) of the sequences were associated with predicted proteins described, whereas 18% (40/222) of the sequences did not show significant identity with sequences deposited in databases, suggesting that they may represent T. rangeli-specific sequences. Among the 182 predicted sequences, 179 (80.6%) had the highest similarity with T. cruzi, 2 (0.9%) with T. brucei, and 1 (0.5%) with L. braziliensis. Computer analysis permitted the identification of members of various gene families described for trypanosomatids in the genome of T. rangeli, such as trans-sialidases, mucin-associated surface proteins, and major surface proteases (MSP or gp63). This is the first report identifying sequences of the MSP family in T. rangeli. Multiple sequence alignments showed that the predicted MSP of T. rangeli presented the typical characteristics of metalloproteases, such as the presence of the HEXXH motif, which corresponds to a region previously associated with the catalytic site of the enzyme, and various cysteine and proline residues, which are conserved among MSPs of different trypanosomatid species. Reverse transcriptase-polymerase chain reaction analysis revealed the presence of MSP transcripts in epimastigote forms of T. rangeli.

Lossless filter for multiple repeats with bounded edit distance

Background: Identifying local similarity between two or more sequences, or identifying repeats occurring at least twice in a sequence, is an essential part in the analysis of biological sequences and of their phylogenetic relationship. Finding such fragments while allowing for a certain number of insertions, deletions, and substitutions, is however known to be a computationally expensive task, and consequently exact methods can usually not be applied in practice. Results: The filter TUIUIU that we introduce in this paper provides a possible solution to this problem. It can be used as a preprocessing step to any multiple alignment or repeats inference method, eliminating a possibly large fraction of the input that is guaranteed not to contain any approximate repeat. It consists in the verification of several strong necessary conditions that can be checked in a fast way. We implemented three versions of the filter. The first is simply a straightforward extension to the case of multiple sequences of an application of conditions already existing in the literature. The second uses a stronger condition which, as our results show, enable to filter sensibly more with negligible (if any) additional time. The third version uses an additional condition and pushes the sensibility of the filter even further with a non negligible additional time in many circumstances; our experiments show that it is particularly useful with large error rates. The latter version was applied as a preprocessing of a multiple alignment tool, obtaining an overall time (filter plus alignment) on average 63 and at best 530 times smaller than before (direct alignment), with in most cases a better quality alignment. Conclusion: To the best of our knowledge, TUIUIU is the first filter designed for multiple repeats and for dealing with error rates greater than 10% of the repeats length.

Local search multiuser detection

In this work, a wide analysis of local search multiuser detection (LS-MUD) for direct sequence/code division multiple access (DS/CDMA) systems under multipath channels is carried out considering the performance-complexity trade-off. It is verified the robustness of the LS-MUD to variations in loading, E(b)/N(0), near-far effect, number of fingers of the Rake receiver and errors in the channel coefficients estimates. A compared analysis of the bit error rate (BER) and complexity trade-off is accomplished among LS, genetic algorithm (GA) and particle swarm optimization (PSO). Based on the deterministic behavior of the LS algorithm, it is also proposed simplifications over the cost function calculation, obtaining more efficient algorithms (simplified and combined LS-MUD versions) and creating new perspectives for the MUD implementation. The computational complexity is expressed in terms of the number of operations in order to converge. Our conclusion pointed out that the simplified LS (s-LS) method is always more efficient, independent of the system conditions, achieving a better performance with a lower complexity than the others heuristics detectors. Associated to this, the deterministic strategy and absence of input parameters made the s-LS algorithm the most appropriate for the MUD problem. (C) 2008 Elsevier GmbH. All rights reserved.

A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints.

MOLECULAR CHARACTERIZATION AND SEQUENCE PHYLOGENETIC ANALYSIS OF SURFACE ANTIGEN 3 (SAG3) GENE OF LOCAL INDIAN ISOLATES (CHENNAI AND IZATNAGAR) OF Toxoplasma gondii

Context and objective:The molecular characterization of local isolates of Toxoplasma gondii is considered significant so as to assess the homologous variations between the different loci of various strains of parasites.Design and setting:The present communication deals with the molecular cloning and sequence analysis of the 1158 bp entire open reading frame (ORF) of surface antigen 3 (SAG3) of two Indian T. gondii isolates (Chennai and Izatnagar) being maintained as cryostock at the IVRI.Method:The surface antigen 3 (SAG3) of two local Indian isolates were cloned and sequenced before being compared with the available published sequences.Results:The sequence comparison analysis revealed 99.9% homology with the standard published RH strain sequence of T. gondii. The strains were also compared with other established published sequences and found to be most related to the P-Br strain and CEP strain (both 99.3%), and least with PRU strain (98.4%). However, the two Indian isolates had 100% homology between them.Conclusion:Finally, it was concluded that the Indian isolates were closer to the RH strain than to the P-Br strain (Brazilian strain), the CEP strain and the PRU strains (USA), with respect to nucleotide homology. The two Indian isolates used in the present study are known to vary between themselves, as far as homologies related to other genes are concerned, but they were found to be 100% homologous as far as SAG3 locus is concerned. This could be attributed to the fact that this SAG3 might be a conserved locus and thereby, further detailed studies are thereby warranted to exploit the use of this particular molecule in diagnostics and immunoprophylactics. The findings are important from the point of view of molecular phylogeny.

Global vs. local nonlinear optimization techniques for human-like movement of an anthropomorphic robot

In this paper a comparison between using global and local optimization techniques for solving the problem of generating human-like arm and hand movements for an anthropomorphic dual arm robot is made. Although the objective function involved in each optimization problem is convex, there is no evidence that the admissible regions of these problems are convex sets. For the sequence of movements for which the numerical tests were done there were no significant differences between the optimal solutions obtained using the global and the local techniques. This suggests that the optimal solution obtained using the local solver is indeed a global solution.

Transcription factor map alignment of promoter regions

We address the problem of comparing and characterizing the promoter regions of genes with similar expression patterns. This remains a challenging problem in sequence analysis, because often the promoter regions of co-expressed genes do not show discernible sequence conservation. In our approach, thus, we have not directly compared the nucleotide sequence of promoters. Instead, we have obtained predictions of transcription factor binding sites, annotated the predicted sites with the labels of the corresponding binding factors, and aligned the resulting sequences of labels—to which we refer here as transcription factor maps (TF-maps). To obtain the global pairwise alignment of two TF-maps, we have adapted an algorithm initially developed to align restriction enzyme maps. We have optimized the parameters of the algorithm in a small, but well-curated, collection of human–mouse orthologous gene pairs. Results in this dataset, as well as in an independent much larger dataset from the CISRED database, indicate that TF-map alignments are able to uncover conserved regulatory elements, which cannot be detected by the typical sequence alignments.

Chroma binary similarity and local alignment applied to cover song identification

We present a new technique for audio signal comparison based on tonal subsequence alignment and its application to detect cover versions (i.e., different performances of the same underlying musical piece). Cover song identification is a task whose popularity has increased in the Music Information Retrieval (MIR) community along in the past, as it provides a direct and objective way to evaluate music similarity algorithms.This article first presents a series of experiments carried outwith two state-of-the-art methods for cover song identification.We have studied several components of these (such as chroma resolution and similarity, transposition, beat tracking or Dynamic Time Warping constraints), in order to discover which characteristics would be desirable for a competitive cover song identifier. After analyzing many cross-validated results, the importance of these characteristics is discussed, and the best-performing ones are finally applied to the newly proposed method. Multipleevaluations of this one confirm a large increase in identificationaccuracy when comparing it with alternative state-of-the-artapproaches.

How Much Does It Cost? Optimization of Costs in Sequence Analysis of Social Science Data

One major methodological problem in analysis of sequence data is the determination of costs from which distances between sequences are derived. Although this problem is currently not optimally dealt with in the social sciences, it has some similarity with problems that have been solved in bioinformatics for three decades. In this article, the authors propose an optimization of substitution and deletion/insertion costs based on computational methods. The authors provide an empirical way of determining costs for cases, frequent in the social sciences, in which theory does not clearly promote one cost scheme over another. Using three distinct data sets, the authors tested the distances and cluster solutions produced by the new cost scheme in comparison with solutions based on cost schemes associated with other research strategies. The proposed method performs well compared with other cost-setting strategies, while it alleviates the justification problem of cost schemes.

A proposal to estimate the motion of an underwater vehicle through visual mosaicking

This thesis proposes a solution to the problem of estimating the motion of an Unmanned Underwater Vehicle (UUV). Our approach is based on the integration of the incremental measurements which are provided by a vision system. When the vehicle is close to the underwater terrain, it constructs a visual map (so called "mosaic") of the area where the mission takes place while, at the same time, it localizes itself on this map, following the Concurrent Mapping and Localization strategy. The proposed methodology to achieve this goal is based on a feature-based mosaicking algorithm. A down-looking camera is attached to the underwater vehicle. As the vehicle moves, a sequence of images of the sea-floor is acquired by the camera. For every image of the sequence, a set of characteristic features is detected by means of a corner detector. Then, their correspondences are found in the next image of the sequence. Solving the correspondence problem in an accurate and reliable way is a difficult task in computer vision. We consider different alternatives to solve this problem by introducing a detailed analysis of the textural characteristics of the image. This is done in two phases: first comparing different texture operators individually, and next selecting those that best characterize the point/matching pair and using them together to obtain a more robust characterization. Various alternatives are also studied to merge the information provided by the individual texture operators. Finally, the best approach in terms of robustness and efficiency is proposed. After the correspondences have been solved, for every pair of consecutive images we obtain a list of image features in the first image and their matchings in the next frame. Our aim is now to recover the apparent motion of the camera from these features. Although an accurate texture analysis is devoted to the matching pro-cedure, some false matches (known as outliers) could still appear among the right correspon-dences. For this reason, a robust estimation technique is used to estimate the planar transformation (homography) which explains the dominant motion of the image. Next, this homography is used to warp the processed image to the common mosaic frame, constructing a composite image formed by every frame of the sequence. With the aim of estimating the position of the vehicle as the mosaic is being constructed, the 3D motion of the vehicle can be computed from the measurements obtained by a sonar altimeter and the incremental motion computed from the homography. Unfortunately, as the mosaic increases in size, image local alignment errors increase the inaccuracies associated to the position of the vehicle. Occasionally, the trajectory described by the vehicle may cross over itself. In this situation new information is available, and the system can readjust the position estimates. Our proposal consists not only in localizing the vehicle, but also in readjusting the trajectory described by the vehicle when crossover information is obtained. This is achieved by implementing an Augmented State Kalman Filter (ASKF). Kalman filtering appears as an adequate framework to deal with position estimates and their associated covariances. Finally, some experimental results are shown. A laboratory setup has been used to analyze and evaluate the accuracy of the mosaicking system. This setup enables a quantitative measurement of the accumulated errors of the mosaics created in the lab. Then, the results obtained from real sea trials using the URIS underwater vehicle are shown.