Filling-in Void and Sparse Regions in Protein Sequence Space by Protein-Like Artificial Sequences Enables Remarkable Enhancement in Remote Homology Detection Capability

Protein functional annotation relies on the identification of accurate relationships, sequence divergence being a key factor. This is especially evident when distant protein relationships are demonstrated only with three-dimensional structures. To address this challenge, we describe a computational approach to purposefully bridge gaps between related protein families through directed design of protein-like ``linker'' sequences. For this, we represented SCOP domain families, integrated with sequence homologues, as multiple profiles and performed HMM-HMM alignments between related domain families. Where convincing alignments were achieved, we applied a roulette wheel-based method to design 3,611,010 protein-like sequences corresponding to 374 SCOP folds. To analyze their ability to link proteins in homology searches, we used 3024 queries to search two databases, one containing only natural sequences and another one additionally containing designed sequences. Our results showed that augmented database searches showed up to 30% improvement in fold coverage for over 74% of the folds, with 52 folds achieving all theoretically possible connections. Although sequences could not be designed between some families, the availability of designed sequences between other families within the fold established the sequence continuum to demonstrate 373 difficult relationships. Ultimately, as a practical and realistic extension, we demonstrate that such protein-like sequences can be ``plugged-into'' routine and generic sequence database searches to empower not only remote homology detection but also fold recognition. Our richly statistically supported findings show that complementary searches in both databases will increase the effectiveness of sequence-based searches in recognizing all homologues sharing a common fold. (C) 2013 Elsevier Ltd. All rights reserved.

Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels

We model communication of bursty sources: 1) over multiaccess channels, with either independent decoding or joint decoding and 2) over degraded broadcast channels, by a discrete-time multiclass processor sharing queue. We utilize error exponents to give a characterization of the processor sharing queue. We analyze the processor sharing queue model for the stable region of message arrival rates, and show the existence of scheduling policies for which the stability region converges to the information-theoretic capacity region in an appropriate limiting sense.

Specific Sequence of a Beta Turn in Human La Protein May Contribute to Species Specificity of Hepatitis C Virus

Human La protein is known to be an essential host factor for translation and replication of hepatitis C virus (HCV) RNA. Previously, we have demonstrated that residues responsible for interaction of human La protein with the HCV internal ribosomal entry site (IRES) around the initiator AUG within stem-loop IV form a beta-turn in the RNA recognition motif (RRM) structure. In this study, sequence alignment and mutagenesis suggest that the HCV RNA-interacting beta-turn is conserved only in humans and chimpanzees, the species primarily known to be infected by HCV. A 7-mer peptide corresponding to the HCV RNA-interacting region of human La inhibits HCV translation, whereas another peptide corresponding to the mouse La sequence was unable to do so. Furthermore, IRES-mediated translation was found to be significantly high in the presence of recombinant human La protein in vitro in rabbit reticulocyte lysate. We observed enhanced replication with HCV subgenomic and full-length replicons upon overexpression of either human La protein or a chimeric mouse La protein harboring a human La beta-turn sequence in mouse cells. Taken together, our results raise the possibility of creating an immunocompetent HCV mouse model using human-specific cell entry factors and a humanized form of La protein.

Fair Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles

We consider the problem of ``fair'' scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking decisions in this framework based on truthful information from the mobiles on their radio channel. We study the well-known family of parametric alpha-fair scheduling problems from a game-theoretic perspective in which some of the mobiles may be noncooperative. We first show that if the BS is unaware of the noncooperative behavior from the mobiles, the noncooperative mobiles become successful in snatching the resources from the other cooperative mobiles, resulting in unfair allocations. If the BS is aware of the noncooperative mobiles, a new game arises with BS as an additional player. It can then do better by neglecting the signals from the noncooperative mobiles. The BS, however, becomes successful in eliciting the truthful signals from the mobiles only when it uses additional information (signal statistics). This new policy along with the truthful signals from mobiles forms a Nash equilibrium (NE) that we call a Truth Revealing Equilibrium. Finally, we propose new iterative algorithms to implement fair scheduling policies that robustify the otherwise nonrobust (in presence of noncooperation) alpha-fair scheduling algorithms.

Comparative Study of Protein Unfolding in Aqueous Urea and Dimethyl Sulfoxide Solutions: Surface Polarity, Solvent Specificity, and Sequence of Secondary Structure Melting

Elucidation of possible pathways between folded (native) and unfolded states of a protein is a challenging task, as the intermediates are often hard to detect. Here, we alter the solvent environment in a controlled manner by choosing two different cosolvents of water, urea, and dimethyl sulfoxide (DMSO) and study unfolding of four different proteins to understand the respective sequence of melting by computer simulation methods. We indeed find interesting differences in the sequence of melting of alpha helices and beta sheets in these two solvents. For example, in 8 M urea solution, beta-sheet parts of a protein are found to unfold preferentially, followed by the unfolding of alpha helices. In contrast, 8 M DMSO solution unfolds alpha helices first, followed by the separation of beta sheets for the majority of proteins. Sequence of unfolding events in four different alpha/beta proteins and also in chicken villin head piece (HP-36) both in urea and DMSO solutions demonstrate that the unfolding pathways are determined jointly by relative exposure of polar and nonpolar residues of a protein and the mode of molecular action of a solvent on that protein.

Role of DNA sequence based structural features of promoters in transcription initiation and gene expression

D Regulatory information for transcription initiation is present in a stretch of genomic DNA, called the promoter region that is located upstream of the transcription start site (TSS) of the gene. The promoter region interacts with different transcription factors and RNA polymerase to initiate transcription and contains short stretches of transcription factor binding sites (TFBSs), as well as structurally unique elements. Recent experimental and computational analyses of promoter sequences show that they often have non-B-DNA structural motifs, as well as some conserved structural properties, such as stability, bendability, nucleosome positioning preference and curvature, across a class of organisms. Here, we briefly describe these structural features, the differences observed in various organisms and their possible role in regulation of gene expression.

An extended Shine-Dalgarno sequence in mRNA functionally bypasses a vital defect in initiator tRNA

Initiator tRNAs are special in their direct binding to the ribosomal P-site due to the hallmark occurrence of the three consecutive G-C base pairs (3GC pairs) in their anticodon stems. How the 3GC pairs function in this role, has remained unsolved. We show that mutations in either the mRNA or 16S rRNA leading to extended interaction between the Shine-Dalgarno (SD) and anti-SD sequences compensate for the vital need of the 3GC pairs in tRNA(fMet) for its function in Escherichia coli. In vivo, the 3GC mutant tRNA(fMet) occurred less abundantly in 70S ribosomes but normally on 30S subunits. However, the extended SD:anti-SD interaction increased its occurrence in 70S ribosomes. We propose that the 3GC pairs play a critical role in tRNA(fMet) retention in ribosome during the conformational changes that mark the transition of 30S preinitiation complex into elongation competent 70S complex. Furthermore, treating cells with kasugamycin, decreasing ribosome recycling factor (RRF) activity or increasing initiation factor 2 (IF2) levels enhanced initiation with the 3GC mutant tRNA(fMet), suggesting that the 70S mode of initiation is less dependent on the 3GC pairs in tRNA(fMet).

An Unusual Ring-Contraction/Rearrangement Sequence for Making Functionalized Di- and Triquinanes

A novel ring contraction/rearrangement sequence leading to functionalized 2,8-oxymethano-bridged di- and triquinane compounds is observed in the reaction of various substituted 1-methyl-4-isopropenyl-6-oxabicylo3.2.1]octan-8-ones with Lewis acids. The reaction is novel and is unprecedented for the synthesis of di- and triquinane frameworks.

An Unusual Ring-Contraction/Rearrangement Sequence for Making Functionalized Di- and Triquinanes

A novel ring contraction/rearrangement sequence leading to functionalized 2,8-oxymethano-bridged di- and triquinane compounds is observed in the reaction of various substituted 1-methyl-4-isopropenyl-6-oxabicylo3.2.1]octan-8-ones with Lewis acids. The reaction is novel and is unprecedented for the synthesis of di- and triquinane frameworks.

Two timescale convergent Q-learning for sleep-scheduling in wireless sensor networks

In this paper, we consider an intrusion detection application for Wireless Sensor Networks. We study the problem of scheduling the sleep times of the individual sensors, where the objective is to maximize the network lifetime while keeping the tracking error to a minimum. We formulate this problem as a partially-observable Markov decision process (POMDP) with continuous stateaction spaces, in a manner similar to Fuemmeler and Veeravalli (IEEE Trans Signal Process 56(5), 2091-2101, 2008). However, unlike their formulation, we consider infinite horizon discounted and average cost objectives as performance criteria. For each criterion, we propose a convergent on-policy Q-learning algorithm that operates on two timescales, while employing function approximation. Feature-based representations and function approximation is necessary to handle the curse of dimensionality associated with the underlying POMDP. Our proposed algorithm incorporates a policy gradient update using a one-simulation simultaneous perturbation stochastic approximation estimate on the faster timescale, while the Q-value parameter (arising from a linear function approximation architecture for the Q-values) is updated in an on-policy temporal difference algorithm-like fashion on the slower timescale. The feature selection scheme employed in each of our algorithms manages the energy and tracking components in a manner that assists the search for the optimal sleep-scheduling policy. For the sake of comparison, in both discounted and average settings, we also develop a function approximation analogue of the Q-learning algorithm. This algorithm, unlike the two-timescale variant, does not possess theoretical convergence guarantees. Finally, we also adapt our algorithms to include a stochastic iterative estimation scheme for the intruder's mobility model and this is useful in settings where the latter is not known. Our simulation results on a synthetic 2-dimensional network setting suggest that our algorithms result in better tracking accuracy at the cost of only a few additional sensors, in comparison to a recent prior work.

An Unusual Ring-Contraction/Rearrangement Sequence for Making Functionalized Di- and Triquinanes

A novel ring contraction/rearrangement sequence leading to functionalized 2,8-oxymethano-bridged di- and triquinane compounds is observed in the reaction of various substituted 1-methyl-4-isopropenyl-6-oxabicylo3.2.1]octan-8-ones with Lewis acids. The reaction is novel and is unprecedented for the synthesis of di- and triquinane frameworks.

Sequence and conformational preferences at termini of alpha-helices in membrane proteins: Role of the helix environment

-helices are amongst the most common secondary structural elements seen in membrane proteins and are packed in the form of helix bundles. These -helices encounter varying external environments (hydrophobic, hydrophilic) that may influence the sequence preferences at their N and C-termini. The role of the external environment in stabilization of the helix termini in membrane proteins is still unknown. Here we analyze -helices in a high-resolution dataset of integral -helical membrane proteins and establish that their sequence and conformational preferences differ from those in globular proteins. We specifically examine these preferences at the N and C-termini in helices initiating/terminating inside the membrane core as well as in linkers connecting these transmembrane helices. We find that the sequence preferences and structural motifs at capping (Ncap and Ccap) and near-helical (N' and C') positions are influenced by a combination of features including the membrane environment and the innate helix initiation and termination property of residues forming structural motifs. We also find that a large number of helix termini which do not form any particular capping motif are stabilized by formation of hydrogen bonds and hydrophobic interactions contributed from the neighboring helices in the membrane protein. We further validate the sequence preferences obtained from our analysis with data from an ultradeep sequencing study that identifies evolutionarily conserved amino acids in the rat neurotensin receptor. The results from our analysis provide insights for the secondary structure prediction, modeling and design of membrane proteins. Proteins 2014; 82:3420-3436. (c) 2014 Wiley Periodicals, Inc.

Structure-specific nuclease activity of RAGs is modulated by sequence, length and phase position of flanking double-stranded DNA

RAGs (recombination activating genes) are responsible for the generation of antigen receptor diversity through the process of combinatorial joining of different V (variable), D (diversity) and J (joining) gene segments. In addition to its physiological property, wherein RAG functions as a sequence-specific nuclease, it can also act as a structure-specific nuclease leading to genomic instability and cancer. In the present study, we investigate the factors that regulate RAG cleavage on non-B DNA structures. We find that RAG binding and cleavage on heteroduplex DNA is dependent on the length of the double-stranded flanking region. Besides, the immediate flanking double-stranded region regulates RAG activity in a sequence-dependent manner. Interestingly, the cleavage efficiency of RAGs at the heteroduplex region is influenced by the phasing of DNA. Thus, our results suggest that sequence, length and phase positions of the DNA can affect the efficiency of RAG cleavage when it acts as a structure-specific nuclease. These findings provide novel insights on the regulation of the pathological functions of RAGs.

A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

In WSNs the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting simultaneously. Such a situation is known as spatially correlated contention. The random access method to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration, and therefore generating an optimal or suboptimal schedule is not very useful. Additionally, if an algorithm takes very long time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. In this paper, we present a distributed TDMA slot scheduling (DTSS) algorithm, which considerably reduces the time required to perform scheduling, while restricting the schedule length to the maximum degree of interference graph. The DTSS algorithm supports unicast, multicast, and broadcast scheduling, simultaneously without any modification in the protocol. We have analyzed the protocol for average case performance and also simulated it using Castalia simulator to evaluate its runtime performance. Both analytical and simulation results show that our protocol is able to considerably reduce the time required for scheduling.

NrichD database: sequence databases enriched with computationally designed protein-like sequences aid in remote homology detection

NrichD ( ext-link-type=''uri'' xlink:href=''http://proline.biochem.iisc.ernet.in/NRICHD/'' xlink:type=''simple''>http://proline.biochem.iisc.ernet.in/NRICHD/)< /named-content> is a database of computationally designed protein-like sequences, augmented into natural sequence databases that can perform hops in protein sequence space to assist in the detection of remote relationships. Establishing protein relationships in the absence of structural evidence or natural `intermediately related sequences' is a challenging task. Recently, we have demonstrated that the computational design of artificial intermediary sequences/linkers is an effective approach to fill naturally occurring voids in protein sequence space. Through a large-scale assessment we have demonstrated that such sequences can be plugged into commonly employed search databases to improve the performance of routinely used sequence search methods in detecting remote relationships. Since it is anticipated that such data sets will be employed to establish protein relationships, two databases that have already captured these relationships at the structural and functional domain level, namely, the SCOP database and the Pfam database, have been `enriched' with these artificial intermediary sequences. NrichD database currently contains 3 611 010 artificial sequences that have been generated between 27 882 pairs of families from 374 SCOP folds. The data sets are freely available for download. Additional features include the design of artificial sequences between any two protein families of interest to the user.