Splicing-dependent NMD does not require the EJC in Schizosaccharomyces pombe

Nonsense-mediated mRNA decay (NMD) is a translation-linked process that destroys mRNAs with premature translation termination codons (PTCs). In mammalian cells, NMD is also linked to pre-mRNA splicing, usually PTCs trigger strong NMD only when positioned upstream of at least one intron. The exon junction complex (EJC) is believed to mediate the link between splicing and NMD in these systems. Here, we report that in Schizosaccharomyces pombe splicing also enhances NMD, but against the EJC model prediction, an intron stimulated NMD regardless of whether it is positioned upstream or downstream of the PTC and EJC components are not required. Still the effect of splicing seems to be direct—we have found that the important NMD determinant is the proximity of an intron to the PTC, not just the occurrence of splicing. On the basis of these results, we propose a new model to explain how splicing could affect NMD

Identification of the occurrence and pattern of masseter muscle activities during sleep using EMG and accelerometer systems

<p>Abstract</p> <p>Background</p> <p>Sleep bruxism has been described as a combination of different orofacial motor activities that include grinding, clenching and tapping, although accurate distribution of the activities still remains to be clarified.</p> <p>Methods</p> <p>We developed a new system for analyzing sleep bruxism to examine the muscle activities and mandibular movement patterns during sleep bruxism. The system consisted of a 2-axis accelerometer, electroencephalography and electromyography. Nineteen healthy volunteers were recruited and screened to evaluate sleep bruxism in the sleep laboratory.</p> <p>Results</p> <p>The new system could easily distinguish the different patterns of bruxism movement of the mandible and the body movement. Results showed that grinding (59.5%) was most common, followed by clenching (35.6%) based on relative activity to maximum voluntary contraction (%MVC), whereas tapping was only (4.9%).</p> <p>Conclusion</p> <p>It was concluded that the tapping, clenching, and grinding movement of the mandible could be effectively differentiated by the new system and sleep bruxism was predominantly perceived as clenching and grinding, which varied between individuals.</p

Improving economic evaluations in stroke : A report from the ESO Health Economics Working Group

Introduction Approaches to economic evaluations of stroke therapies are varied and inconsistently described. An objective of the European Stroke Organisation (ESO) Health Economics Working Group is to standardise and improve the economic evaluations of interventions for stroke. Methods The ESO Health Economics Working Group and additional experts were contacted to develop a protocol and a guidance document for data collection for economic evaluations of stroke therapies. A modified Delphi approach, including a survey and consensus processes, was used to agree on content. We also asked the participants about resources that could be shared to improve economic evaluations of interventions for stroke. Results Of 28 experts invited, 16 (57%) completed the initial survey, with representation from universities, government, and industry. More than half of the survey respondents endorsed 13 specific items to include in a standard resource use questionnaire. Preferred functional/quality of life outcome measures to use for economic evaluations were the modified Rankin Scale (14 respondents, 88%) and the EQ-5D instrument (11 respondents, 69%). Of the 12 respondents who had access to data used in economic evaluations, 10 (83%) indicated a willingness to share data. A protocol template and a guidance document for data collection were developed and are presented in this article. Conclusion The protocol template and guidance document for data collection will support a more standardised and transparent approach for economic evaluations of stroke care.Peer reviewe

Porphyromonas endodontalis in chronic periodontitis: a clinical and microbiological cross-sectional study

Although previous studies have shown the presence of Porphyromonas endodontalis in chronic periodontitis associated with periapical lesions, the occurrence of this pathogen in diseased periodontal sites without periapical lesions has been poorly investigated.The aims of this study were to quantify P. endodontalis in patients with chronic periodontitis without periapical lesions, to evaluate the potential correlation of P. endodontalis with Porphyromonas gingivalis and Tannerella forsythia, and to evaluate the ability of periodontal treatment to reduce these pathogens.Patients with generalized chronic periodontitis were selected by recording clinical attachment level (CAL), probing depth (PD), and bleeding on probing (BOP). Subgingival samples from 30 diseased nonadjacent sites (CAL&#x200A;&#x2265;&#x200A;5 mm, PD between 5 and 7 mm and positive BOP) and 30 healthy nonadjacent sites (PD&#x200A;&#x2264;&#x200A;3 mm and negative BOP) were collected and subjected to microbial analysis by quantitative polymerase chain reaction (qPCR) The variables of age, PD, CAL and BOP of all individuals were analyzed using the paired t-test (GrapPad Prism5&#x00AE;). Data of bacteria quantification were subjected to a normality test (D&#x0027;Agostino-Pearson Test). For bacterial correlation analysis, the Spearman correlation was used.Our results showed that diseased sites had significantly higher levels of P. endodontalis compared to healthy sites, similar to the results obtained for P. gingivalis and T. forsythia. The numbers of all bacterial species were reduced significantly after mechanical periodontal treatment. P. endodontalis was significantly correlated with the presence of T. forsythia and P. gingivalis in the diseased group.Our results suggest that there is a high prevalence of P. endodontalis, P. gingivalis and T. forsythia in periodontitis sites and that mechanical periodontal treatment is effective at reducing the pathogens studied

Flow shop rescheduling under different types of disruption

This is an Accepted Manuscript of an article published by Taylor & Francis in International Journal of Production Research on 2013, available online:http://www.tandfonline.com/10.1080/00207543.2012.666856Almost all manufacturing facilities need to use production planning and scheduling systems to increase productivity and to reduce production costs. Real-life production operations are subject to a large number of unexpected disruptions that may invalidate the original schedules. In these cases, rescheduling is essential to minimise the impact on the performance of the system. In this work we consider flow shop layouts that have seldom been studied in the rescheduling literature. We generate and employ three types of disruption that interrupt the original schedules simultaneously. We develop rescheduling algorithms to finally accomplish the twofold objective of establishing a standard framework on the one hand, and proposing rescheduling methods that seek a good trade-off between schedule quality and stability on the other.The authors would like to thank the anonymous referees for their careful and detailed comments that helped to improve the paper considerably. This work is partially financed by the Small and Medium Industry of the Generalitat Valenciana (IMPIVA) and by the European Union through the European Regional Development Fund (FEDER) inside the R + D program "Ayudas dirigidas a Institutos tecnologicos de la Red IMPIVA" during the year 2011, with project number IMDEEA/2011/142.Katragjini Prifti, K.; Vallada Regalado, E.; Ruiz García, R. (2013). Flow shop rescheduling under different types of disruption. International Journal of Production Research. 51(3):780-797. https://doi.org/10.1080/00207543.2012.666856S780797513Abumaizar, R. J., & Svestka, J. A. (1997). Rescheduling job shops under random disruptions. International Journal of Production Research, 35(7), 2065-2082. doi:10.1080/002075497195074Adiri, I., Frostig, E., & Kan, A. H. G. R. (1991). Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs. Naval Research Logistics, 38(2), 261-271. doi:10.1002/1520-6750(199104)38:23.0.co;2-iAkturk, M. S., & Gorgulu, E. (1999). Match-up scheduling under a machine breakdown. European Journal of Operational Research, 112(1), 81-97. doi:10.1016/s0377-2217(97)00396-2Allahverdi, A. (1996). Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computers & Operations Research, 23(10), 909-916. doi:10.1016/0305-0548(96)00012-3Arnaout, J. P., & Rabadi, G. (2008). Rescheduling of unrelated parallel machines under machine breakdowns. International Journal of Applied Management Science, 1(1), 75. doi:10.1504/ijams.2008.020040Artigues, C., Billaut, J.-C., & Esswein, C. (2005). Maximization of solution flexibility for robust shop scheduling. European Journal of Operational Research, 165(2), 314-328. doi:10.1016/j.ejor.2004.04.004Azizoglu, M., & Alagöz, O. (2005). Parallel-machine rescheduling with machine disruptions. IIE Transactions, 37(12), 1113-1118. doi:10.1080/07408170500288133Bean, J. C., Birge, J. R., Mittenthal, J., & Noon, C. E. (1991). Matchup Scheduling with Multiple Resources, Release Dates and Disruptions. Operations Research, 39(3), 470-483. doi:10.1287/opre.39.3.470Caricato, P., & Grieco, A. (2008). An online approach to dynamic rescheduling for production planning applications. International Journal of Production Research, 46(16), 4597-4617. doi:10.1080/00207540601136225CHURCH, L. K., & UZSOY, R. (1992). Analysis of periodic and event-driven rescheduling policies in dynamic shops. International Journal of Computer Integrated Manufacturing, 5(3), 153-163. doi:10.1080/09511929208944524Cowling, P., & Johansson, M. (2002). Using real time information for effective dynamic scheduling. European Journal of Operational Research, 139(2), 230-244. doi:10.1016/s0377-2217(01)00355-1Curry, J., & Peters *, B. (2005). Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives. International Journal of Production Research, 43(15), 3231-3246. doi:10.1080/00207540500103953DUTTA, A. (1990). Reacting to Scheduling Exceptions in FMS Environments. IIE Transactions, 22(4), 300-314. doi:10.1080/07408179008964185Ghezail, F., Pierreval, H., & Hajri-Gabouj, S. (2010). Analysis of robustness in proactive scheduling: A graphical approach. Computers & Industrial Engineering, 58(2), 193-198. doi:10.1016/j.cie.2009.03.004Goren, S., & Sabuncuoglu, I. (2008). Robustness and stability measures for scheduling: single-machine environment. IIE Transactions, 40(1), 66-83. doi:10.1080/07408170701283198Hall, N. G., & Potts, C. N. (2004). Rescheduling for New Orders. Operations Research, 52(3), 440-453. doi:10.1287/opre.1030.0101Herrmann, J. W., Lee, C.-Y., & Snowdon, J. L. (1993). A Classification of Static Scheduling Problems. Complexity in Numerical Optimization, 203-253. doi:10.1142/9789814354363_0011Herroelen, W., & Leus, R. (2005). Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research, 165(2), 289-306. doi:10.1016/j.ejor.2004.04.002Hozak, K., & Hill, J. A. (2009). Issues and opportunities regarding replanning and rescheduling frequencies. International Journal of Production Research, 47(18), 4955-4970. doi:10.1080/00207540802047106Huaccho Huatuco, L., Efstathiou, J., Calinescu, A., Sivadasan, S., & Kariuki, S. (2009). Comparing the impact of different rescheduling strategies on the entropic-related complexity of manufacturing systems. International Journal of Production Research, 47(15), 4305-4325. doi:10.1080/00207540701871036Jensen, M. T. (2003). Generating robust and flexible job shop schedules using genetic algorithms. IEEE Transactions on Evolutionary Computation, 7(3), 275-288. doi:10.1109/tevc.2003.810067King, J. R. (1976). The theory-practice gap in job-shop scheduling. Production Engineer, 55(3), 137. doi:10.1049/tpe.1976.0044Kopanos, G. M., Capón-García, E., Espuña,, A., & Puigjaner, L. (2008). Costs for Rescheduling Actions: A Critical Issue for Reducing the Gap between Scheduling Theory and Practice. Industrial & Engineering Chemistry Research, 47(22), 8785-8795. doi:10.1021/ie8005676Lee, C.-Y., Leung, J. Y.-T., & Yu, G. (2006). Two Machine Scheduling under Disruptions with Transportation Considerations. Journal of Scheduling, 9(1), 35-48. doi:10.1007/s10951-006-5592-7Li, Z., & Ierapetritou, M. (2008). Process scheduling under uncertainty: Review and challenges. Computers & Chemical Engineering, 32(4-5), 715-727. doi:10.1016/j.compchemeng.2007.03.001Liao, C. J., & Chen, W. J. (2004). Scheduling under machine breakdown in a continuous process industry. Computers & Operations Research, 31(3), 415-428. doi:10.1016/s0305-0548(02)00224-1Mehta, S. V. (1999). Predictable scheduling of a single machine subject to breakdowns. International Journal of Computer Integrated Manufacturing, 12(1), 15-38. doi:10.1080/095119299130443MUHLEMANN, A. P., LOCKETT, A. G., & FARN, C.-K. (1982). Job shop scheduling heuristics and frequency of scheduling. International Journal of Production Research, 20(2), 227-241. doi:10.1080/00207548208947763Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91-95. doi:10.1016/0305-0483(83)90088-9O’Donovan, R., Uzsoy, R., & McKay, K. N. (1999). Predictable scheduling of a single machine with breakdowns and sensitive jobs. International Journal of Production Research, 37(18), 4217-4233. doi:10.1080/002075499189745Özlen, M., & Azizoğlu, M. (2009). Generating all efficient solutions of a rescheduling problem on unrelated parallel machines. International Journal of Production Research, 47(19), 5245-5270. doi:10.1080/00207540802043998Pfeiffer, A., Kádár, B., & Monostori, L. (2007). Stability-oriented evaluation of rescheduling strategies, by using simulation. Computers in Industry, 58(7), 630-643. doi:10.1016/j.compind.2007.05.009Pierreval, H., & Durieux-Paris, S. (2007). Robust simulation with a base environmental scenario. European Journal of Operational Research, 182(2), 783-793. doi:10.1016/j.ejor.2006.07.045Damodaran, P., Hirani, N. S., & Gallego, M. C. V. (2009). Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. European J. of Industrial Engineering, 3(2), 187. doi:10.1504/ejie.2009.023605Qi, X., Bard, J. F., & Yu, G. (2006). Disruption management for machine scheduling: The case of SPT schedules. International Journal of Production Economics, 103(1), 166-184. doi:10.1016/j.ijpe.2005.05.021Rangsaritratsamee, R., Ferrell, W. G., & Kurz, M. B. (2004). Dynamic rescheduling that simultaneously considers efficiency and stability. Computers & Industrial Engineering, 46(1), 1-15. doi:10.1016/j.cie.2003.09.007Ruiz, R., & Stützle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033-2049. doi:10.1016/j.ejor.2005.12.009Sabuncuoglu, I., & Goren, S. (2009). Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research. International Journal of Computer Integrated Manufacturing, 22(2), 138-157. doi:10.1080/09511920802209033Sabuncuoglu, I., & Kizilisik, O. B. (2003). Reactive scheduling in a dynamic and stochastic FMS environment. International Journal of Production Research, 41(17), 4211-4231. doi:10.1080/0020754031000149202Salveson, M. E. (1952). On a Quantitative Method in Production Planning and Scheduling. Econometrica, 20(4), 554. doi:10.2307/1907643Samarghandi, H., & ElMekkawy, T. Y. (2011). An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server. European J. of Industrial Engineering, 5(2), 111. doi:10.1504/ejie.2011.039869Subramaniam *, V., Raheja, A. S., & Rama Bhupal Reddy, K. (2005). Reactive repair tool for job shop schedules. International Journal of Production Research, 43(1), 1-23. doi:10.1080/0020754042000270412Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47(1), 65-74. doi:10.1016/0377-2217(90)90090-xTaillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278-285. doi:10.1016/0377-2217(93)90182-mValente, J. M. S., & Schaller, J. E. (2010). Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties. European J. of Industrial Engineering, 4(1), 99. doi:10.1504/ejie.2010.029572Vallada, E., & Ruiz, R. (2010). Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆. Omega, 38(1-2), 57-67. doi:10.1016/j.omega.2009.04.002Vieira, G. E., Herrmann, J. W., & Lin, E. (2000). Predicting the performance of rescheduling strategies for parallel machine systems. Journal of Manufacturing Systems, 19(4), 256-266. doi:10.1016/s0278-6125(01)80005-4Vieira, G. E., Herrmann, J. W., & Lin, E. (2003). Journal of Scheduling, 6(1), 39-62. doi:10.1023/a:1022235519958Yang, J., & Yu, G. (2002). Journal of Combinatorial Optimization, 6(1), 17-33. doi:10.1023/a:1013333232691Zandieh, M., & Gholami, M. (2009). An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Production Research, 47(24), 6999-7027. doi:10.1080/0020754080240063

Alternative splicing and nonsense-mediated decay regulate telomerase reverse transcriptase (TERT) expression during virus-induced lymphomagenesis in vivo

<p>Abstract</p> <p>Background</p> <p>Telomerase activation, a critical step in cell immortalization and oncogenesis, is partly regulated by alternative splicing. In this study, we aimed to use the Marek's disease virus (MDV) T-cell lymphoma model to evaluate TERT regulation by splicing during lymphomagenesis <it>in vivo</it>, from the start point to tumor establishment.</p> <p>Results</p> <p>We first screened cDNA libraries from the chicken MDV lymphoma-derived MSB-1 T- cell line, which we compared with B (DT40) and hepatocyte (LMH) cell lines. The chTERT splicing pattern was cell line-specific, despite similar high levels of telomerase activity. We identified 27 alternative transcripts of chicken TERT (chTERT). Five were in-frame alternative transcripts without <it>in vitro </it>telomerase activity in the presence of viral or chicken telomerase RNA (vTR or chTR), unlike the full-length transcript. Nineteen of the 22 transcripts with a premature termination codon (PTC) harbored a PTC more than 50 nucleotides upstream from the 3' splice junction, and were therefore predicted targets for nonsense-mediated decay (NMD). The major PTC-containing alternatively spliced form identified in MSB1 (ie10) was targeted to the NMD pathway, as demonstrated by UPF1 silencing. We then studied three splicing events separately, and the balance between in-frame alternative splice variants (d5f and d10f) plus the NMD target i10ec and constitutively spliced chTERT transcripts during lymphomagenesis induced by MDV indicated that basal telomerase activity in normal T cells was associated with a high proportion of in-frame non functional isoforms and a low proportion of constitutively spliced chTERT. Telomerase upregulation depended on an increase in active constitutively spliced chTERT levels and coincided with a switch in alternative splicing from an in-frame variant to NMD-targeted variants.</p> <p>Conclusions</p> <p>TERT regulation by splicing plays a key role in telomerase upregulation during lymphomagenesis, through the sophisticated control of constitutive and alternative splicing. Using the MDV T-cell lymphoma model, we identified a chTERT splice variant as a new NMD target.</p

Insight into the evolution of the Solanaceae from the parental genomes of Petunia hybrida

Petunia hybrida is a popular bedding plant that has a long history as a genetic model system. We report the whole-genome sequencing and assembly of inbred derivatives of its two wild parents, P. axillaris N and P. inflata S6. The current assemblies include 91.3% and 90.2% coverage of their diploid genomes (1.4 Gb; 2n=14) containing 32,928 and 36,697 protein-coding genes, respectively. The Petunia lineage has experienced at least two rounds of paleohexaploidization, the older gamma hexaploidy event, which is shared with other Eudicots, and the more recent Solanaceae paleohexaploidy event that is shared with tomato and other Solanaceae species. Transcription factors that were targets of selection during the shift from bee- to moth pollination reside in particularly dynamic regions of the genome, which may have been key to the remarkable diversity of floral color patterns and pollination systems. The high quality genome sequences will enhance the value of Petunia as a model system for basic and applied research on a variety of unique biological phenomena