The first small-molecule inhibitors of members of the ribonuclease E family

The Escherichia coli endoribonuclease RNase E is central to the processing and degradation of all types of RNA and as such is a pleotropic regulator of gene expression. It is essential for growth and was one of the first examples of an endonuclease that can recognise the 5′-monophosphorylated ends of RNA thereby increasing the efficiency of many cleavages. Homologues of RNase E can be found in many bacterial families including important pathogens, but no homologues have been identified in humans or animals. RNase E represents a potential target for the development of new antibiotics to combat the growing number of bacteria that are resistant to antibiotics in use currently. Potent small molecule inhibitors that bind the active site of essential enzymes are proving to be a source of potential drug leads and tools to dissect function through chemical genetics. Here we report the use of virtual high-throughput screening to obtain small molecules predicted to bind at sites in the N-terminal catalytic half of RNase E. We show that these compounds are able to bind with specificity and inhibit catalysis of Escherichia coli and Mycobacterium tuberculosis RNase E and also inhibit the activity of RNase G, a paralogue of RNase E

Bidding Games on Markov Decision Processes

In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher bidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one

Widest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games

Solving stochastic games with the reachability objective is a fundamental problem, especially in quantitative verification and synthesis. For this purpose, bounded value iteration (BVI) attracts attention as an efficient iterative method. However, BVI's performance is often impeded by costly end component (EC) computation that is needed to ensure convergence. Our contribution is a novel BVI algorithm that conducts, in addition to local propagation by the Bellman update that is typical of BVI, global propagation of upper bounds that is not hindered by ECs. To conduct global propagation in a computationally tractable manner, we construct a weighted graph and solve the widest path problem in it. Our experiments show the algorithm's performance advantage over the previous BVI algorithms that rely on EC computation.Comment: v2: an URL to the implementation is adde

Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm

Simple stochastic games can be solved by value iteration (VI), which yields a sequence of under-approximations of the value of the game. This sequence is guaranteed to converge to the value only in the limit. Since no stopping criterion is known, this technique does not provide any guarantees on its results. We provide the first stopping criterion for VI on simple stochastic games. It is achieved by additionally computing a convergent sequence of over-approximations of the value, relying on an analysis of the game graph. Consequently, VI becomes an anytime algorithm returning the approximation of the value and the current error bound. As another consequence, we can provide a simulation-based asynchronous VI algorithm, which yields the same guarantees, but without necessarily exploring the whole game graph.Comment: CAV201

Three Essential Ribonucleases—RNase Y, J1, and III—Control the Abundance of a Majority of Bacillus subtilis mRNAs

Bacillus subtilis possesses three essential enzymes thought to be involved in mRNA decay to varying degrees, namely RNase Y, RNase J1, and RNase III. Using recently developed high-resolution tiling arrays, we examined the effect of depletion of each of these enzymes on RNA abundance over the whole genome. The data are consistent with a model in which the degradation of a significant number of transcripts is dependent on endonucleolytic cleavage by RNase Y, followed by degradation of the downstream fragment by the 5′–3′ exoribonuclease RNase J1. However, many full-size transcripts also accumulate under conditions of RNase J1 insufficiency, compatible with a model whereby RNase J1 degrades transcripts either directly from the 5′ end or very close to it. Although the abundance of a large number of transcripts was altered by depletion of RNase III, this appears to result primarily from indirect transcriptional effects. Lastly, RNase depletion led to the stabilization of many low-abundance potential regulatory RNAs, both in intergenic regions and in the antisense orientation to known transcripts

LNCS

We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as angelic and demonic non-determinism. Lexicographic order allows to consider multiple objectives with a strict preference order over the satisfaction of the objectives. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. We establish determinacy of such games and present strategy and computational complexity results. For strategy complexity, we show that lexicographically optimal strategies exist that are deterministic and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in NP∩coNP , matching the current known bound for single objectives; and in general the decision problem is PSPACE -hard and can be solved in NEXPTIME∩coNEXPTIME . We present an algorithm that computes the lexicographically optimal strategies via a reduction to computation of optimal strategies in a sequence of single-objectives games. We have implemented our algorithm and report experimental results on various case studies

Macrophages Are Required for Dendritic Cell Uptake of Respiratory Syncytial Virus from an Infected Epithelium

We have previously shown that the respiratory syncytial virus [RSV] can productively infect monocyte derived dendritic cells [MoDC] and remain dormant within the same cells for prolonged periods. It is therefore possible that infected dendritic cells act as a reservoir within the airways of individuals between annual epidemics. In the present study we explored the possibility that sub-epithelial DCs can be infected with RSV from differentiated bronchial epithelium and that in turn RSV from DCs can infect the epithelium. A dual co-culture model was established in which a differentiated primary airway epithelium on an Air Liquid Interface (ALI) was cultured on a transwell insert and MoDCs were subsequently added to the basolateral membrane of the insert. Further experiments were undertaken using a triple co-culture model in which in which macrophages were added to the apical surface of the differentiated epithelium. A modified RSV [rr-RSV] expressing a red fluorescent protein marker of replication was used to infect either the MoDCs or the differentiated epithelium and infection of the reciprocal cell type was assessed using confocal microscopy. Our data shows that primary epithelium became infected when rr-RSV infected MoDCs were introduced onto the basal surface of the transwell insert. MoDCs located beneath the epithelium did not become infected with virus from infected epithelial cells in the dual co-culture model. However when macrophages were present on the apical surface of the primary epithelium infection of the basal MoDCs occurred. Our data suggests that RSV infected dendritic cells readily transmit infection to epithelial cells even when they are located beneath the basal layer. However macrophages appear to be necessary for the transmission of infection from epithelial cells to basal dendritic cells

Three-year randomised clinical trial to evaluate the clinical performance, quantitative and qualitative wear patterns of hybrid composite restorations

The aim of the study was to compare the clinical performance, quantitative and qualitative wear patterns of conventional hybrid (Tetric Ceram), micro-filled hybrid (Gradia Direct Posterior) and nano-hybrid (Tetric EvoCeram, TEC) posterior composite restorations in a 3-year randomised clinical trial. Sixteen Tetric Ceram, 17 TEC and 16 Gradia Direct Posterior restorations were placed in human molars and evaluated at baseline, 6, 12, 24 and 36 months of clinical service according to US Public Health Service criteria. The gypsum replicas at each recall were used for 3D laser scanning to quantify wear, and the epoxy resin replicas were observed under scanning electron microscope to study the qualitative wear patterns. After 3 years of clinical service, the three hybrid restorative materials performed clinically well in posterior cavities. Within the observation period, the nano-hybrid and micro-hybrid restorations evolved better in polishability with improved surface gloss retention than the conventional hybrid counterpart. The three hybrid composites showed enamel-like vertical wear and cavity-size dependant volume loss magnitude. Qualitatively, while the micro-filled and nano-hybrid composite restorations exhibited signs of fatigue similar to the conventional hybrid composite restorations at heavy occlusal contact area, their light occlusal contact areas showed less surface pitting after 3 years of clinical service

Model of the complex of Parathyroid hormone-2 receptor and Tuberoinfundibular peptide of 39 residues

<p>Abstract</p> <p>Background</p> <p>We aim to propose interactions between the parathyroid hormone-2 receptor (PTH2R) and its ligand the tuberoinfundibular peptide of 39 residues (TIP39) by constructing a homology model of their complex. The two related peptides parathyroid hormone (PTH) and parathyroid hormone related protein (PTHrP) are compared with the complex to examine their interactions.</p> <p>Findings</p> <p>In the model, the hydrophobic N-terminus of TIP39 is buried in a hydrophobic part of the central cavity between helices 3 and 7. Comparison of the peptide sequences indicates that the main discriminator between the agonistic peptides TIP39 and PTH and the inactive PTHrP is a tryptophan-phenylalanine replacement. The model indicates that the smaller phenylalanine in PTHrP does not completely occupy the binding site of the larger tryptophan residue in the other peptides. As only TIP39 causes internalisation of the receptor and the primary difference being an aspartic acid in position 7 of TIP39 that interacts with histidine 396 in the receptor, versus isoleucine/histidine residues in the related hormones, this might be a trigger interaction for the events that cause internalisation.</p> <p>Conclusions</p> <p>A model is constructed for the complex and a trigger interaction for full agonistic activation between aspartic acid 7 of TIP39 and histidine 396 in the receptor is proposed.</p