Nomenclature for human glutathione transferases.
Explore the source record for details and available documents.
Alleles↗
Biomedical subjects
W R Pearson
Publications and source records attributed to W R Pearson.
Dynamic programming algorithms for biological sequence comparison.
Efficient dynamic programming algorithms are available for a broad class of protein and DNA sequence comparison problems. These algorithms require computer time proportional to the product of the lengths of the two sequences being compared [O(N2)] but require memory space proportional only to the sum of these lengths [O(N)]. Although the requirement for O(N2) time limits use of the algorithms to the largest computers when searching protein and DNA sequence databases, many other applications of these algorithms, such as calculation of distances for evolutionary trees and comparison of a new sequence to a library of sequence profiles, are well within the capabilities of desktop computers. In particular, the results of library searches with rapid searching programs, such as FASTA or BLAST, should be confirmed by performing a rigorous optimal alignment. Whereas rapid methods do not overlook significant sequence similarities, FASTA limits the number of gaps that can be inserted into an alignment, so that a rigorous alignment may extend the alignment substantially in some cases. BLAST does not allow gaps in the local regions that it reports; a calculation that allows gaps is very likely to extend the alignment substantially. Although a Monte Carlo evaluation of the statistical significance of a similarity score with a rigorous algorithm is much slower than the heuristic approach used by the RDF2 program, the dynamic programming approach should take less than 1 hr on a 386-based PC or desktop Unix workstation. For descriptive purposes, we have limited our discussion to methods for calculating similarity scores and distances that use gap penalties of the form g = rk. Nevertheless, programs for the more general case (g = q+rk) are readily available. Versions of these programs that run either on Unix workstations, IBM-PC class computers, or the Macintosh can be obtained from either of the authors.
Algorithms↗
Comparing machine-independent versus machine-specific parallelization of a software platform for biological sequence comparison.
A platform program that performs biological sequence comparison provides a case study to compare the relative advantages of a machine-independent approach to parallel computation versus a machine-specific approach. The program consists of two routines: (i) PSCANLIB, which compares a single biological sequence against a database of sequences, and (ii) PCOMPLIB, which compares a database of sequences against another database of sequences, or against itself. The program was first parallelized to run on the Intel Hypercube parallel computer using native Hypercube commands to coordinate the parallel computation. The parallelization logic of the program was then translated into a machine-independent parallel programming language, Linda. These two approaches to parallelization are contrasted in terms of: (i) the expressive power of the logic that coordinates the parallel computation, (ii) the portability of the machine-independent version to other parallel machines and (iii) the relative efficiency of the two versions of the program. In the benchmark tests reported, the benefits of the machine-independent approach were achieved with only a modest sacrifice in efficiency.
Algorithms↗
Aligning two sequences within a specified diagonal band.
We describe an algorithm for aligning two sequences within a diagonal band that requires only O(NW) computation time and O(N) space, where N is the length of the shorter of the two sequences and W is the width of the band. The basic algorithm can be used to calculate either local or global alignment scores. Local alignments are produced by finding the beginning and end of a best local alignment in the band, and then applying the global alignment algorithm between those points. This algorithm has been incorporated into the FASTA program package, where it has decreased the amount of memory required to calculate local alignments from O(NW) to O(N) and decreased the time required to calculate optimized scores for every sequence in a protein sequence database by 40%. On computers with limited memory, such as the IBM-PC, this improvement both allows longer sequences to be aligned and allows optimization within wider bands, which can include longer gaps.
Algorithms↗
The origin of nuclear receptor proteins: a single precursor distinct from other transcription factors.
Explore the source record for details and available documents.
Algorithms↗
Heterologous expression of the allelic variant mu-class glutathione transferases mu and psi.
cDNA encoding the more acidic form, glutathione transferase (GST) psi, of the polymorphic Mu-class GSTs discovered in liver, was mutated in the 5'-end to create an NcoI site, facilitating cloning into the expression plasmid pKK233-2. The protein expressed from this construct has a point mutation Pro-2----Ala-2, but gives a catalytically functional protein. Back-mutation of the codon for amino acid residue 2 gave rise to a plasmid expressing the wild-type enzyme GST psi, or GST Mu1b-1b. A variant cDNA, differing only in specifying lysine rather than asparagine in position 173 of the coding region, was generated by site-directed mutagenesis. The variant sequence corresponds to another cDNA clone isolated from a human liver cDNA library and expresses the near-neutral GST mu, or GST Mu1a-1a. The two recombinant proteins GST Mu1a-1a and GST Mu1b-1b, by physicochemical as well as kinetic criteria, were found to be indistinguishable from GST mu and GST psi respectively, isolated from human liver. It is therefore concluded that the recombinant proteins correspond to the allelic variants observed in the human population. The two forms have different isoelectric points and correspond to the allelic variants observed in the human population. The two forms have different isoelectric points and their protein subunits can be separated by h.p.l.c. on a reverse-phase column. With standard substrates and inhibitors no differences in kinetic parameters between the two variants were detected. The mutated GST Mu1b-1b (Pro-2----Ala) was not significantly different in catalytic properties from the wild-type enzyme, even though Pro-2 is a well conserved amino acid residue in the known Mu-class GSTs.
Alleles↗
Cloning, expression, and characterization of a class-mu glutathione transferase from human muscle, the product of the GST4 locus.
A class-mu glutathione transferase cDNA clone, GTHMUS, was isolated from human myoblasts and its sequence was determined. The sequence predicts a protein of molecular weight 25,599 whose 24 amino-terminal residues are identical to those of the class-mu isoenzyme expressed from the GST4 locus. The GTHMUS cDNA shares 93.7% nucleotide sequence identity with a human liver cDNA clone, GTH411, that is encoded at the GST1 locus. Comparison of the liver and muscle cDNA sequences shows two regions of remarkable sequence conservation: a 140-nucleotide region in the 5' coding portion of the molecule that has a single silent nucleotide substitution, and a 550-nucleotide region, including the entire 3' noncoding region, that has only three nucleotide substitutions or deletions. This sequence conservation suggests that gene conversion has occurred between the human GST1 and GST4 glutathione transferase gene loci. The human muscle and liver glutathione transferase clones GTHMUS and GTH411 have been expressed in Escherichia coli. The kinetic mechanism of the muscle enzyme was examined in product inhibition studies. The inhibition patterns are best modeled by a steady-state ordered bi-bi reaction mechanism. Glutathione is the first substrate bound and chloride ion is the first product released. Chloride ion inhibits the muscle enzyme.
Amino Acid Sequence↗
Molecular characterization of alpha 1- and alpha 2-adrenoceptors.
Three 'alpha 1-adrenoceptors' and three 'alpha 2-adrenoceptors' have now been cloned. How closely do these receptors match the native receptors that have been identified pharmacologically? What are the properties of these receptors, and how do they relate to other members of the cationic amine receptor family? Kevin Lynch and his colleagues discuss these questions in this review.
Amino Acid Sequence↗
Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms.
The sensitivity and selectivity of the FASTA and the Smith-Waterman protein sequence comparison algorithms were evaluated using the superfamily classification provided in the National Biomedical Research Foundation/Protein Identification Resource (PIR) protein sequence database. Sequences from each of the 34 superfamilies in the PIR database with 20 or more members were compared against the protein sequence database. The similarity scores of the related and unrelated sequences were determined using either the FASTA program or the Smith-Waterman local similarity algorithm. These two sets of similarity scores were used to evaluate the ability of the two comparison algorithms to identify distantly related protein sequences. The FASTA program using the ktup = 2 sensitivity setting performed as well as the Smith-Waterman algorithm for 19 of the 34 superfamilies. Increasing the sensitivity by setting ktup = 1 allowed FASTA to perform as well as Smith-Waterman on an additional 7 superfamilies. The rigorous Smith-Waterman method performed better than FASTA with ktup = 1 on 8 superfamilies, including the globins, immunoglobulin variable regions, calmodulins, and plastocyanins. Several strategies for improving the sensitivity of FASTA were examined. The greatest improvement in sensitivity was achieved by optimizing a band around the best initial region found for every library sequence. For every superfamily except the globins and immunoglobulin variable regions, this strategy was as sensitive as a full Smith-Waterman. For some sequences, additional sensitivity was achieved by including conserved but nonidentical residues in the lookup table used to identify the initial region.
Algorithms↗
A platform for biological sequence comparison on parallel computers.
We have written two programs for searching biological sequence databases that run on Intel hypercube computers. PSCANLIB compares a single sequence against a sequence library, and PCOMPLIB compares all the entries in one sequence library against a second library. The programs provide a general framework for similarity searching; they include functions for reading in query sequences, search parameters and library entries, and reporting the results of a search. We have isolated the code for the specific function that calculates the similarity score between the query and library sequence; alternative searching algorithms can be implemented by editing two files. We have implemented the rapid FASTA sequence comparison algorithm and the more rigorous Smith-Waterman algorithm within this framework. The PSCANLIB program on a 16 node iPSC/2 80386-based hypercube can compare a 229 amino acid protein sequence with a 3.4 million residue sequence library in approximately 16 s with the FASTA algorithm. Using the Smith-Waterman algorithm, the same search takes 35 min. The PCOMPLIB program can compare a 0.8 million amino acid protein sequence library with itself in 5.3 min with FASTA on a third-generation 32 node Intel iPSC/860 hypercube.
Algorithms↗
Rapid and sensitive sequence comparison with FASTP and FASTA.
The FASTA program can search the NBRF protein sequence library (2.5 million residues) in less than 20 min on an IBM-PC microcomputer and unambiguously detect proteins that shared a common ancestor billions of years in the past. FASTA is both fast and selective because it initially considers only amino acid identities. Its sensitivity is increased not only by using the PAM250 matrix to score and rescore regions with large numbers of identities but also by joining initial regions. The results of searches with FASTA compare favorably with results using NWS-based programs that are 100 times slower. FASTA is slightly less sensitive but considerably more selective. It is not clear that NWS-based programs would be more successful in finding distantly related members of the G-protein-coupled receptor family. The joining step by FASTA to calculate the initn score is especially useful for sequences that share regions of sequence similarity that are separated by variable-length loops. FASTP and FASTA were designed to identify protein sequences that have descended from a common ancestor, and they have proved very useful for this task. In many cases, a FASTA sequence search will result in a list of high scoring library sequences that are homologous to the query sequence, or the search will result in a list of sequences with similarity scores that cannot be distinguished from the bulk of the library. In either case, the question of whether there are sequences in the library that are clearly related to the query sequence has been answered unambiguously. Unfortunately, the results often will not be so clear-cut, and careful analysis of similarity scores, statistical significance, the actual aligned residues, and the biological context are required. In the course of analyzing the G-protein-coupled receptor family, several proteins were found that, because of a high initn score and a low init1 score that increased almost 2-fold with optimization, appeared to be members of this family which were not previously recognized. RDF2 analysis showed borderline z values, and only a careful examination of the sequence alignments that focused on the conserved residues provided convincing evidence that the high scores were fortuitous. As sequence comparison methods become more powerful by becoming more sensitive, they become more likely to mislead, and even greater care is required.
Algorithms↗
Tissue-specific induction of murine glutathione transferase mRNAs by butylated hydroxyanisole.
Three murine liver glutathione transferase (GT, EC 2.5.1.18) have been cloned and sequenced. Two of the cDNA clones, pGT875 and pGT55, encode the murine class-mu GT isoenzymes, GT8.7 and GT9.3, respectively. These two cDNA clones share 85% DNA sequence identity with one another, and the GT8.7 sub-unit encoded by pGT875 shares 92% protein sequence identity with the class-mu rat-3 (Yb1) GT subunit. The third cDNA clone, pGT41, encodes a class-alpha GT subunit that shares 96% protein sequence identity with a mouse Ya gene, 95% identity with a rat-1 (Ya) GT subunit, and 70% identity with the rat-2 (Yc) subunit. These cDNA clones and an oligonucleotide derived from the sequence of a rat class-pi cDNA clone were used to measure the induction of the mu, alpha, and pi classes of GT mRNA in different tissues of mice that were fed the dietary antioxidant 2(3)-tert-butyl hydroxyanisole (BHA). These tissues included liver, intestinal mucosa, kidney, lung, spleen, and brain. Class-mu GT mRNAs that hybridize with pGT875 are most abundant in liver and intestinal mucosa but are also found in kidney and lung, and at low levels in brain and spleen. Class-alpha GT mRNAs are most abundant in BHA-induced and uninduced intestinal mucosa, kidney, and induced liver, and were not found in spleen and brain. Class-mu and -alpha GT mRNA levels increased 15- and 50-fold, respectively, in the liver and 15- and 100-fold in intestinal mucosa in response to BHA induction. BHA increases class-mu mRNAs less than 5-fold in the kidney and lung. Class-pi mRNAs were found in all the tissues examined but were much less responsive to BHA induction. The expression of two cytochrome P-450 mRNAs increased 3-5-fold in liver and intestine after BHA induction. Oligonucleotides from divergent portions of the pGT875 and pGT55 cDNA clones have been used to examine the expression of specific mRNAs from individual class-mu GT genes; these experiments suggest that the GT mRNAs expressed in BHA-induced tissues are also expressed in the uninduced tissue. Measurements of transcription rates in isolated nuclei showed that increased GT mRNA levels are due to increased rates of transcription.
Amino Acid Sequence↗
Hereditary differences in the expression of the human glutathione transferase active on trans-stilbene oxide are due to a gene deletion.
Glutathione transferase (GT; EC 2.5.1.18) mRNA levels were measured in human liver samples by using mouse and human cDNA clones that encode class-mu and class-alpha GT. Although all the RNA samples examined contained class-alpha GT mRNA, class-mu GT mRNA was found only in individuals whose peripheral leukocytes expressed GT activity on the substrate trans-stilbene oxide. The mouse class-mu cDNA clone was used to identify a human class-mu GT cDNA clone, lambda GTH411. The amino acid sequence of the GT encoded by lambda GTH411 is identical with the 23 residues determined for the human liver GT-mu isoenzyme and shares 76-81% identity with mouse and rat class-mu GT isoenzymes. The mouse and human class-mu GT cDNA inserts hybridize with multiple BamHI and EcoRI restriction fragments in the human genome. One of these hybridizing fragments is missing in the DNA of individuals who lack GT activity on trans-stilbene oxide. Hybridizations with nonoverlapping subfragments of lambda GTH411 suggest that there are at least three class-mu genes in the human genome. One of these genes appears to be deleted in individuals lacking GT activity on trans-stilbene oxide.
Amino Acid Sequence↗
Improved tools for biological sequence comparison.
We have developed three computer programs for comparisons of protein and DNA sequences. They can be used to search sequence data bases, evaluate similarity scores, and identify periodic structures based on local sequence similarity. The FASTA program is a more sensitive derivative of the FASTP program, which can be used to search protein or DNA sequence data bases and can compare a protein sequence to a DNA sequence data base by translating the DNA data base as it is searched. FASTA includes an additional step in the calculation of the initial pairwise similarity score that allows multiple regions of similarity to be joined to increase the score of related sequences. The RDF2 program can be used to evaluate the significance of similarity scores using a shuffling method that preserves local sequence composition. The LFASTA program can display all the regions of local similarity between two sequences with scores greater than a threshold, using the same scoring parameters and a similar alignment algorithm; these local similarities can be displayed as a "graphic matrix" plot or as individual alignments. In addition, these programs have been generalized to allow comparison of DNA or protein sequences based on a variety of alternative scoring matrices.
Amino Acid Sequence↗
Rapid and sensitive protein similarity searches.
An algorithm was developed which facilitates the search for similarities between newly determined amino acid sequences and sequences already available in databases. Because of the algorithm's efficiency on many microcomputers, sensitive protein database searches may now become a routine procedure for molecular biologists. The method efficiently identifies regions of similar sequence and then scores the aligned identical and differing residues in those regions by means of an amino acid replacability matrix. This matrix increases sensitivity by giving high scores to those amino acid replacements which occur frequently in evolution. The algorithm has been implemented in a computer program designed to search protein databases very rapidly. For example, comparison of a 200-amino-acid sequence to the 500,000 residues in the National Biomedical Research Foundation library would take less than 2 minutes on a minicomputer, and less than 10 minutes on a microcomputer (IBM PC).
Amino Acid Sequence↗
Computer programs for analysis of nucleic acid hybridization, thermal denaturation, and gel electrophoresis data.
Computer programs for the analysis of data from techniques frequently used in nucleic acids research are described. In addition to calculating non-linear, least-squares solutions to equations describing these systems, the programs allow for data editing, normalization, plotting and storage, and are flexible and simple to use. Typical applications of the programs are described.
Computers↗
Analysis of rat repetitive DNA sequences.
Parameters of repetitive sequence organization have been measured in the rat genome. Experiments using melting, hydroxylapatite binding, and single strand specific nuclease digestion have been used to measure the number, length, and arrangement of repeated DNA sequences. Renaturation and melting or S1 nuclease digestion of 1.0 kbp DNA fragment show about 20% of rat DNA sequences are 3000-fold repeated. Renatured duplexes from 4.0 kbp DNA fragments display two repetitive size fractions after nuclease digestion. About 60% of the repeated sequences are 0.2-0.4 kbp long while the remainder are longer than 1.5 kbp. The arrangement of the repeated sequences has been measured by hydroxylapatite fractionation of DNA fragments of varying lengths bearing a repeated sequence. Repeated DNA sequences are interspersed among 2.5 kbp long nonrepeated sequences throughout more than 70% of the rat genome. There are approximately 350 different 3000-fold short repeated sequences in the rat interspersed among 600,000 nonrepeated DNA sequences.
Animals↗
Sequence organization of the rat genome by electron microscopy.
The size and arrangement of repetitive and inverted repeat (foldback) sequences in rat DNA were studied by visualization of hybrid and heteroduplex structures in the electron microscope. The self-reassociation of repetitive sequence-bearing DNA strands often results in the formation of four-ended "H" structures, whose duplex regions equal the repetitive sequence length and can be measured in the electron microscope. In this way, it was determined that the average size of the class of numerous short repetitive sequences is 0.40 +/- 0.15 kbp. Heteroduplex structures were prepared between long whole DNA single strands and short repeat-sequence-bearing strands. The analysis of these structures confirms that the size of the repetitive sequences in 0.4 kbp on average. Length measurements between adjacent duplexes show that the average spacing between two interspersed repeats is at least 1.5-1.8 kbp. By examining 29.4-kbp single strands after brief renaturation, the size and distribution of foldback sequences were determined. There are 1.9 X 10(5) foldback apirs per rat genome, spaced an average of 9.7 kbp apart according to our measurement. Repetitive, inverted repeat and unique sequences are interspersed with each other in at least half the genome.
Animals↗