Stochastic kinetics of ribosomes: Single motor properties and collective behavior

Syntheses of protein molecules in a cell are carried out by ribosomes.A ribosome can be regarded as a molecular motor which utilizes the input chemical energy to move on a messenger RNA (mRNA) track that also serves as a template for the polymerization of the corresponding protein. The forward movement, however, is characterized by an alternating sequence of translocation and pause. Using a quantitative model, which captures the mechanochemical cycle of an individual ribosome, we derive an exact analytical expression for the distribution of its dwell times at the successive positions on the mRNA track. Inverse of the average dwell time satisfies a Michaelis-Menten-type'' equation and is consistent with the general formula for the average velocity of a molecular motor with an unbranched mechanochemical cycle. Extending this formula appropriately, we also derive the exact force-velocity relation for a ribosome. Often many ribosomes each synthesizes a copy of the same protein. We extend the model of a single ribosome by incorporating steric exclusion of different individuals on the same track. We draw the phase diagram of this model of ribosome traffic in three-dimensional spaces spanned by experimentally controllable parameters. We suggest new experimental tests of our theoretical predictions.

X-Pro peptides. A theoretical study of the hydrogen bonded conformations of (alpha-aminoisobutyryl-L -prolyl)n sequences

Intramolecularly hydrogen bonded conformations of (Aib-Pro)n sequences have been analysed theoretically. Both 4-1 (C10 and 3-1 (C7 hydrogen bonded regular structures are shown to be stereochemically feasible. Conformational energies for the helical structures have been estimated using classical potential energy methods. Both C10 and C7 conformations have very similar energies. Pyrrolidine ring puckering has a pronounced effect on the energies, and only Cv-endo puckered Pro residues can be accommodated. The theoretical calculations using spectroscopic data suggest that the recently proposed novel 310 helical conformation for benzyloxycarbonyl(Aib-Pro)4-methyl ester is in solution, is indeed energetically and stereochemically favourable.

Stochastic modelling of monthly rainfall

A transformation is suggested which can transform a non-Gaussian monthly hydrological time series into a Gaussian one. The suggested approach is verified with data of ten Indian rainfall time series. Incidentally, it is observed that once the deterministic trends are removed, the transformation leads to an uncorrelated process for monthly rainfall. The procedure for normalization is general enough in that it should be also applicable to river discharges. This is verified to a limited extent by considering data of two Indian river discharges.

X-Pro peptides. A theoretical study of the hydrogen bonded conformations of (a-aminoisobutyryl-L -prolyl)n sequences

Intramolecularly hydrogen bonded conformations of (Aib-Pro)n sequences have been analysed theoretically. Both 4�1 (C10 and 3�1 (C7 hydrogen bonded regular structures are shown to be stereochemically feasible. Conformational energies for the helical structures have been estimated using classical potential energy methods. Both C10 and C7 conformations have very similar energies. Pyrrolidine ring puckering has a pronounced effect on the energies, and only Cγ-endo puckered Pro residues can be accommodated. The theoretical calculations using spectroscopic data suggest that the recently proposed novel 310 helical conformation for benzyloxycarbonyl(Aib-Pro)4-methyl ester is in solution, is indeed energetically and stereochemically favourable.

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Optical Barker sequences and self-orthogonal convolutional codes

The relation between optical Barker codes and self-orthogonal convolutional codes is pointed out. It is then used to update the results in earlier publication.

Multilevel aperiodic Huffman sequences

Certain sequences that have zero aperiodic autocorrelation except for zero and the maximum shifts are described. They are useful in radar pulse compression.

Comments on "Diffuse sound reflection by maximum length sequences"

Some improvements are suggested to Schroeder's scheme [J. Acoust. Soc. Am. 57, 149–150 (1975)] of achieving diffuse sound reflection in concert halls.Subject Classification

Immunological studies on nucleic-acids and their components .6. Antibodies specific to two deoxyribotrinucleotide sequences

Antibodies to the deoxyribotrinucleotides dpApTpA and dpApApT were prepared by injecting the bovine serum albumin conjugates of the respective haptens in rabbits. The specificities of the antibodies were determined by estimating the inhibition of the binding of the tritiated haptens to the immunoglobulins by various nonradioactive mono- and oligonucleotides, using nitrocellulose membrane binding assay. Anti-dpApTpA and anti-dpApApT antisera were found to contain antibodies which were highly specific to the respective hapten sequence.

Polypurine/polypyrimidine sequences as cis-acting transcriptional regulators

Genome sequence information has generated increasing evidence for the claim that repetitive DNA sequences present within and around genes could play a important role in the regulation of gene expression. Polypurine/polypyrimidine sequences [poly(Pu/Py)] have been observed in the vicinity of promoters and within the transcribed regions of many genes. To understand whether such sequences influence the level of gene expression, we constructed several prokaryotic and eukaryotic expression vectors incorporating poly(Pu/Py) repeats both within and upstream of a reporter gene, lacZ (encoding β-galactosidase), and studied its expression in vivo. We find that, in contrast to the situation in Escherichia coli, the presence of poly(Pu/Py) sequences within the gene does not significantly inhibit gene expression in mammalian cells. On the other hand, the presence of such sequences upstream of lacZ leads to a several-fold reduction of gene expression in mammalian cells. Similar down-regulation was observed when a structural cassette containing poly(Pu/Py) sequences upstream of lacZ was integrated into yeast chromosome V. Sequence analysis of the nine totally sequenced yeast chromosomes shows that a large number of such sequences occur upstream of ORFs. On the basis of our experimental results and DNA sequence analysis, we propose that these sequences can function as cis-acting transcriptional regulators.

Analysis of the amino acid sequences of plant Bowman-Birk inhibitors

Plant seeds contain a large number of protease inhibitors of animal, fungal, and bacterial origin. One of the well-studied families of these inhibitors is the Bowman-Birk family(BBI). The BBIs from dicotyledonous seeds are 8K, double-headed proteins. In contrast, the 8K inhibitors from monocotyledonous seeds are single headed. Monocots also have a 16K, double-headed inhibitor. We have determined the primary structure of a Bowman-Birk inhibitor from a dicot, horsegram, by sequential edman analysis of the intact protein and peptides derived from enzymatic and chemical cleavage. The 76-residue-long inhibitor is very similar to that ofMacrotyloma axillare. An analysis of this inhibitor along with 26 other Bowman-Birk inhibitor domains (MW 8K) available in the SWISSPROT databank revealed that the proteins from monocots and dicots belong to related but distinct families. Inhibitors from monocots show larger variation in sequence. Sequence comparison shows that a crucial disulphide which connects the amino and carboxy termini of the active site loop is lost in monocots. The loss of a reactive site in monocots seems to be correlated to this. However, it appears that this disulphide is not absolutely essential for retention of inhibitory function. Our analysis suggests that gene duplication leading to a 16K inhibitor in monocots has occurred, probably after the divergence of monocots and dicots, and also after the loss of second reactive site in monocots.

The fully implicit stochastic-alpha method for stiff stochastic differential equations

A fully implicit integration method for stochastic differential equations with significant multiplicative noise and stiffness in both the drift and diffusion coefficients has been constructed, analyzed and illustrated with numerical examples in this work. The method has strong order 1.0 consistency and has user-selectable parameters that allow the user to expand the stability region of the method to cover almost the entire drift-diffusion stability plane. The large stability region enables the method to take computationally efficient time steps. A system of chemical Langevin equations simulated with the method illustrates its computational efficiency.

An FETI-preconditioned conjuerate gradient method for large-scale stochastic finite element problems

In the spectral stochastic finite element method for analyzing an uncertain system. the uncertainty is represented by a set of random variables, and a quantity of Interest such as the system response is considered as a function of these random variables Consequently, the underlying Galerkin projection yields a block system of deterministic equations where the blocks are sparse but coupled. The solution of this algebraic system of equations becomes rapidly challenging when the size of the physical system and/or the level of uncertainty is increased This paper addresses this challenge by presenting a preconditioned conjugate gradient method for such block systems where the preconditioning step is based on the dual-primal finite element tearing and interconnecting method equipped with a Krylov subspace reusage technique for accelerating the iterative solution of systems with multiple and repeated right-hand sides. Preliminary performance results on a Linux Cluster suggest that the proposed Solution method is numerically scalable and demonstrate its potential for making the uncertainty quantification Of realistic systems tractable.

Simple repetitive sequences in the genome: structure and functional significance

The current explosion of DNA sequence information has generated increasing evidence for the claim that noncoding repetitive DNA sequences present within and around different genes could play an important role in genetic control processes, although the precise role and mechanism by which these sequences function are poorly understood. Several of the simple repetitive sequences which occur in a large number of loci throughout the human and other eukaryotic genomes satisfy the sequence criteria for forming non-B DNA structures in vitro. We have summarized some of the features of three different types of simple repeats that highlight the importance of repetitive DNA in the control of gene expression and chromatin organization. (i) (TG/CA)n repeats are widespread and conserved in many loci. These sequences are associated with nucleosomes of varying linker length and may play a role in chromatin organization. These Z-potential sequences can help absorb superhelical stress during transcription and aid in recombination. (ii) Human telomeric repeat (TTAGGG)n adopts a novel quadruplex structure and exhibits unusual chromatin organization. This unusual structural motif could explain chromosome pairing and stability. (iii) Intragenic amplification of (CTG)n/(CAG)n trinucleotide repeat, which is now known to be associated with several genetic disorders, could down-regulate gene expression in vivo. The overall implications of these findings vis-à-vis repetitive sequences in the genome are summarized.

A Search for Energy Minimized Sequences of Proteins

In this paper, we present numerical evidence that supports the notion of minimization in the sequence space of proteins for a target conformation. We use the conformations of the real proteins in the Protein Data Bank (PDB) and present computationally efficient methods to identify the sequences with minimum energy. We use edge-weighted connectivity graph for ranking the residue sites with reduced amino acid alphabet and then use continuous optimization to obtain the energy-minimizing sequences. Our methods enable the computation of a lower bound as well as a tight upper bound for the energy of a given conformation. We validate our results by using three different inter-residue energy matrices for five proteins from protein data bank (PDB), and by comparing our energy-minimizing sequences with 80 million diverse sequences that are generated based on different considerations in each case. When we submitted some of our chosen energy-minimizing sequences to Basic Local Alignment Search Tool (BLAST), we obtained some sequences from non-redundant protein sequence database that are similar to ours with an E-value of the order of 10(-7). In summary, we conclude that proteins show a trend towards minimizing energy in the sequence space but do not seem to adopt the global energy-minimizing sequence. The reason for this could be either that the existing energy matrices are not able to accurately represent the inter-residue interactions in the context of the protein environment or that Nature does not push the optimization in the sequence space, once it is able to perform the function.