Analysis of antibody A6 binding to the extracellular interferon gamma receptor alpha-chain by alanine-scanning mutagenesis and random mutagenesis with phage display

The monoclonal antibody A6 binds a conformational epitope comprising mainly the CC' surface loop on the N-terminal fibronectin type-III domain of the extracellular interferon gamma receptor (IFNgammaR). The crystal structure of an A6 Fab-IFNgammaR complex revealed an interface rich in the aromatic side chains of Trp, Tyr, and His residues. These aromatic side chains appear to interact with both polar and hydrophobic groups at the interface, a property which, in general, may be advantageous for ligand binding. To analyze these interactions in more detail, the affinities of 19 A6 alanine-scanning mutants for the IFNgammaR have been measured, using engineered A6 single chain variable region fragments, and a surface plasmon resonance biosensor. Energetically important side chains (DeltaG(mutant) - DeltaG(wt) > 2.4 kcal/mol), that form distinct hot spots in the binding interface, have been identified on both proteins. These include V(L)W92 in A6, whose benzenoid ring appears well situated for a pi-cation (or pi-amine) interaction with the side chain of receptor residue K47 and simultaneously for T-stacking onto the indole ring of W82 in the receptor. At another site, energetically important residues V(H)W52 and V(H)W53, as well as V(H)D54 and V(H)D56, surround the aliphatic side chain of the hot receptor residue K52. Taken together, the results show that side chains distributed across the interface, including many aromatic ones, make key energetic contributions to binding. In addition, the receptor CC' loop has been subjected to random mutagenesis, and receptor mutants with high affinity for A6 have been selected by phage display. Residues previously identified as important for receptor binding to A6 were conserved in the clones isolated. Some mutants, however, showed a much improved affinity for A6, due to changes at Glu55, a residue that appeared to be energetically unimportant for binding the antibody by alanine-scanning mutagenesis. An E55P receptor mutant bound A6 with a 600-fold increase in affinity (K(D) approximately 20 pM), which is one of the largest improvements in affinity from a single point mutation reported so far at any protein-protein interface.     

A computer program to search for tRNA genes.

This paper describes a computer program that can find tRNA genes within long DNA sequences. The program obviates the need to map the tRNA genes.     

A computer program for the estimation of protein and nucleic acid sequence diversity in random point mutagenesis libraries

A computer program for the generation and analysis of in silico random point mutagenesis libraries is described. The program operates by mutagenizing an input nucleic acid sequence according to mutation parameters specified by the user for each sequence position and type of point mutation. The program can mimic almost any type of random mutagenesis library, including those produced via error-prone PCR (ep-PCR), mutator Escherichia coli strains, chemical mutagenesis, and doped or random oligonucleotide synthesis. The program analyzes the generated nucleic acid sequences and/or the associated protein library to produce several estimates of library diversity (number of unique sequences, point mutations, and single point mutants) and the rate of saturation of these diversities during experimental screening or selection of clones. This information allows one to select the optimal screen size for a given mutagenesis library, necessary to efficiently obtain a certain coverage of the sequence-space. The program also reports the abundance of each specific protein mutation at each sequence position, which is useful as a measure of the level and type of mutation bias in the library. Alternatively, one can use the program to evaluate the relative merits of preexisting libraries, or to examine various hypothetical mutation schemes to determine the optimal method for creating a library that serves the screen/selection of interest. Simulated libraries of at least 10⁹ sequences are accessible by the numerical algorithm with currently available personal computers; an analytical algorithm is also available which can rapidly calculate a subset of the numerical statistics in libraries of arbitrarily large size. A multi-type double-strand stochastic model of ep-PCR is developed in an appendix to demonstrate the applicability of the algorithm to amplifying mutagenesis procedures. Estimators of DNA polymerase mutation-type-specific error rates are derived using the model. Analyses of an alpha-synuclein ep-PCR library and NNS synthetic oligonucleotide libraries are given as examples.     

A simulation program to display specific digestion products of predicted RNA foldings

A parameterizable program in Pascal was developed for VAX/VMScomputers to simulate the autoradiograms of gel-separated RNAfragments generated by partial cleavage of a folded RNA moleculeusing five specific RNases. Each screen displays the resultsof cleavage by either one enzyme or all five, with the RNA moleculelabeled at either of its ends (5' or 3'); each run is performedwith three different lengths and against a ladder containingalkaline hydrolysis products of the same RNA molecule as sizemarkers. The program should be useful for comparing actual resultswith predicted functional foldings of RNA molecules. Received on May 28, 1990; accepted on August 28, 1990     

The mouse linkage map. A computer program

Computer programs have been developed to serve as a method for storing, retrieving, and sorting mouse linkage data. The programs accept and store raw data and reference information for gene linkage; calculate recombination values for each data set and for combined data sets; retrieve, sort, and print-out raw data, references, and recombination values; and generate linkage maps.     

A computer program for analyzing bivariate flow karyotypes

This article describes a computer program for analyzing bivariate flow karyotypes of human chromosomes stained with Hoechst 33258 (HO) and chromomycin A3 (CA). The karyotype first is divided into regions that contain chromosome peaks. The chromosomes that are associated with those areas are identified. The distributions in these areas then are fitted with mathematical functions of increasing complexity. The process starts by fitting a specified number of univariate Gauss functions to projections of the HO and CA distributions of each area. The final fit can include multiple bivariate Gauss functions, including a background function for debris subtraction. The results of one stage in the fitting process serve as seed values for the next, more complex step. Since the program autonomously estimates the starting values for the iterative fitting procedures, the fit results are insensitive to operator bias and the program will consistently converge to the same solutions. The resulting table of parameter values can be used to compare flow karyotypes to a reference data set.     

A computer program package for relative survival analysis

A computer program package has been constructed for use in patient survival analyses for chronic diseases based on aggregated data. The central concept of the analyses--the relative survival rate--is the ratio of the observed survival rate of the patients to the survival rate expected in a group in the general population similar to the group of patients at the beginning of the follow-up (interval), with respect to age, sex and calendar time. This quantity is used to measure patient survival adjusted for the effect of mortality attributable to the competing risks of death without employing information on causes of death of individual patients. The package contains three alternative methods of estimating the relative survival rates, two different ways of estimating the expectation of life for the patients, and five methods of testing the relative survival patterns using information on the whole follow-up period. Conventional survival and competing risk analysis can also be performed with the package. It is hoped that the package will facilitate standardization of statistical methodology and terminology in long-term survival studies for chronic diseases.     

A computer program that simulates cloning of DNA

Easy Cloner is a computer program that manipulates DNA sequences as in cloning experiments and produces maps of the resulting plasmids. The program runs in the graphics mode of an IBM PC or compatible computer and is operated by using a mouse to point to the required actions. The program is available in the public domain.