225 research outputs found

    Collagen prolyl hydroxylation-dependent metabolic perturbation governs epigenetic remodeling and mesenchymal transition in pluripotent and cancer cells

    Get PDF
    Collagen prolyl hydroxylation (CPH), which is catalyzed by prolyl 4-hydroxylase (P4H), is the most prevalent posttranslational modification in humans and requires Vitamin C (VitC). Here we demonstrate that CPH acts as an epigenetic modulator of cell plasticity. Increased CPH induced global DNA/histone methylation in pluripotent stem and tumor cells and promoted cell state transition (CST). Interfering with CPH by either genetic ablation of P4H subunit alpha-2 (P4HA2) or pharmacologic treatment reverted epigenetic changes and antagonized CST. Mechanistically, we suggest that CPH modifies the epigenetic landscape by reducing VitC for DNA and histone demethylases. Repurposed drugs targeting CPH-mediated metabolic perturbation, such as the antiasthmatic Budesonide, blocked metastatic dissemination of breast cancer cells in vivo by preventing mesenchymal transition. Our study provides mechanistic insights into how metabolic cues and epigenetic factors integrate to control cell state transition and paves the way for the development of novel antimetastatic strategies. Significance: A phenotype-based high-throughput screening reveals unforeseen metabolic control of cell plasticity and identifies budesonide as a drug candidate for metastatic cancer

    Mtss1 promotes cell-cell junction assembly and stability through the small GTPase Rac1

    Get PDF
    Cell-cell junctions are an integral part of epithelia and are often disrupted in cancer cells during epithelial-to-mesenchymal transition (EMT), which is a main driver of metastatic spread. We show here that Metastasis suppressor-1 (Mtss1; Missing in Metastasis, MIM), a member of the IMD-family of proteins, inhibits cell-cell junction disassembly in wound healing or HGF-induced scatter assays by enhancing cell-cell junction strength. Mtss1 not only makes cells more resistant to cell-cell junction disassembly, but also accelerates the kinetics of adherens junction assembly. Mtss1 drives enhanced junction formation specifically by elevating Rac-GTP. Lastly, we show that Mtss1 depletion reduces recruitment of F-actin at cell-cell junctions. We thus propose that Mtss1 promotes Rac1 activation and actin recruitment driving junction maintenance. We suggest that the observed loss of Mtss1 in cancers may compromise junction stability and thus promote EMT and metastasis

    The GTPase-activating protein RN-tre controls focal adhesion turnover and cell migration.

    Get PDF
    SummaryBackgroundIntegrin-mediated adhesion of cells to the extracellular matrix (ECM) relies on the dynamic formation of focal adhesions (FAs), which are biochemical and mechanosensitive platforms composed of a large variety of cytosolic and transmembrane proteins. During migration, there is a constant turnover of ECM contacts that initially form as nascent adhesions at the leading edge, mature into FAs as actomyosin tension builds up, and are then disassembled at the cell rear, thus allowing for cell detachment. Although the mechanisms of FA assembly have largely been defined, the molecular circuitry that regulates their disassembly still remains elusive.ResultsHere, we show that RN-tre, a GTPase-activating protein (GAP) for Rabs including Rab5 and Rab43, is a novel regulator of FA dynamics and cell migration. RN-tre localizes to FAs and to a pool of Rab5-positive vesicles mainly associated with FAs undergoing rapid remodeling. We found that RN-tre inhibits endocytosis of β1, but not β3, integrins and delays the turnover of FAs, ultimately impairing β1-dependent, but not β3-dependent, chemotactic cell migration. All of these effects are mediated by its GAP activity and rely on Rab5.ConclusionsOur findings identify RN-tre as the Rab5-GAP that spatiotemporally controls FA remodeling during chemotactic cell migration

    A criterion for separating process calculi

    Get PDF
    We introduce a new criterion, replacement freeness, to discern the relative expressiveness of process calculi. Intuitively, a calculus is strongly replacement free if replacing, within an enclosing context, a process that cannot perform any visible action by an arbitrary process never inhibits the capability of the resulting process to perform a visible action. We prove that there exists no compositional and interaction sensitive encoding of a not strongly replacement free calculus into any strongly replacement free one. We then define a weaker version of replacement freeness, by only considering replacement of closed processes, and prove that, if we additionally require the encoding to preserve name independence, it is not even possible to encode a non replacement free calculus into a weakly replacement free one. As a consequence of our encodability results, we get that many calculi equipped with priority are not replacement free and hence are not encodable into mainstream calculi like CCS and pi-calculus, that instead are strongly replacement free. We also prove that variants of pi-calculus with match among names, pattern matching or polyadic synchronization are only weakly replacement free, hence they are separated both from process calculi with priority and from mainstream calculi.Comment: In Proceedings EXPRESS'10, arXiv:1011.601

    Chronic Replication Problems Impact Cell Morphology and Adhesion of DNA Ligase I Defective Cells

    Get PDF
    Moderate DNA damage resulting from metabolic activities or sub-lethal doses of exogenous insults may eventually lead to cancer onset. Human 46BR.1G1 cells bear a mutation in replicative DNA ligase I (LigI) which results in low levels of replication-dependent DNA damage. This replication stress elicits a constitutive phosphorylation of the ataxia telangiectasia mutated (ATM) checkpoint kinase that fails to arrest cell cycle progression or to activate apoptosis or cell senescence. Stable transfection of wild type LigI, as in 7A3 cells, prevents DNA damage and ATM activation. Here we show that parental 46BR.1G1 and 7A3 cells differ in important features such as cell morphology, adhesion and migration. Comparison of gene expression profiles in the two cell lines detects Bio-Functional categories consistent with the morphological and migration properties of LigI deficient cells. Interestingly, ATM inhibition makes 46BR.1G1 more similar to 7A3 cells for what concerns morphology, adhesion and expression of cell-cell adhesion receptors. These observations extend the influence of the DNA damage response checkpoint pathways and unveil a role for ATM kinase activity in modulating cell biology parameters relevant to cancer progression

    Unjamming overcomes kinetic and proliferation arrest in terminally differentiated cells and promotes collective motility of carcinoma

    Get PDF
    During wound repair, branching morphogenesis and carcinoma dissemination, cellular rearrangements are fostered by a solid-to-liquid transition, known as unjamming. The biomolecular machinery behind unjamming and its pathophysiological relevance remain, however, unclear. Here, we study unjamming in a variety of normal and tumorigenic epithelial two-dimensional (2D) and 3D collectives. Biologically, the increased level of the small GTPase RAB5A sparks unjamming by promoting non-clathrin-dependent internalization of epidermal growth factor receptor that leads to hyperactivation of the kinase ERK1/2 and phosphorylation of the actin nucleator WAVE2. This cascade triggers collective motility effects with striking biophysical consequences. Specifically, unjamming in tumour spheroids is accompanied by persistent and coordinated rotations that progressively remodel the extracellular matrix, while simultaneously fluidizing cells at the periphery. This concurrent action results in collective invasion, supporting the concept that the endo-ERK1/2 pathway is a physicochemical switch to initiate collective invasion and dissemination of otherwise jammed carcinoma

    A Finite Representation of the Narrowing Space

    Full text link
    The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-14125-1_4Narrowing basically extends rewriting by allowing free variables in terms and by replacing matching with unification. As a consequence, the search space of narrowing becomes usually infinite, as in logic programming. In this paper, we introduce the use of some operators that allow one to always produce a finite data structure that still represents all the narrowing derivations. Furthermore, we extract from this data structure a novel, compact equational representation of the (possibly infinite) answers computed by narrowing for a given initial term. Both the finite data structure and the equational representation of the computed answers might be useful in a number of areas, like program comprehension, static analysis, program transformation, etc.Nishida, N.; Vidal, G. (2013). A Finite Representation of the Narrowing Space. En Logic-Based Program Synthesis and Transformation. Springer. 54-71. doi:10.1007/978-3-319-14125-1_4S5471Albert, E., Vidal, G.: The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing 20(1), 3–26 (2002)Alpuente, M., Falaschi, M., Vidal, G.: Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems 20(4), 768–844 (1998)Alpuente, M., Falaschi, M., Vidal, G.: Compositional Analysis for Equational Horn Programs. In: Rodríguez-Artalejo, M., Levi, G. (eds.) ALP 1994. LNCS, vol. 850, pp. 77–94. Springer, Heidelberg (1994)Antoy, S., Ariola, Z.: Narrowing the Narrowing Space. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 1–15. Springer, Heidelberg (1997)Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1–2), 133–178 (2000)Arts, T., Zantema, H.: Termination of Logic Programs Using Semantic Unification. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol. 1048, pp. 219–233. Springer, Heidelberg (1996)Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)Bae, K., Escobar, S., Meseguer, J.: Abstract Logical Model Checking of Infinite-State Systems Using Narrowing. In: Proceedings of the 24th International Conference on Rewriting Techniques and Applications. LIPIcs, vol. 21, pp. 81–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)De Schreye, D., Glück, R., Jørgensen, J., Leuschel, M., Martens, B., Sørensen, M.: Conjunctive partial deduction: foundations, control, algorihtms, and experiments. Journal of Logic Programming 41(2&3), 231–277 (1999)Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theoretical Computer Science 367(1–2), 162–202 (2006)Escobar, S., Meseguer, J.: Symbolic Model Checking of Infinite-State Systems Using Narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153–168. Springer, Heidelberg (2007)Fribourg, L.: SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In: Proceedings of the Symposium on Logic Programming, pp. 172–185. IEEE Press (1985)Gnaedig, I., Kirchner, H.: Proving weak properties of rewriting. Theoretical Computer Science 412(34), 4405–4438 (2011)Hanus, M.: The integration of functions into logic programming: From theory to practice. Journal of Logic Programming 19&20, 583–628 (1994)Hanus, M. (ed.): Curry: An integrated functional logic language (vers. 0.8.3) (2012). http://www.curry-language.orgHermenegildo, M., Rossi, F.: On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs. In: Lusk, E., Overbeck, R. (eds.) Proceedings of the 1989 North American Conf. on Logic Programming, pp. 369–389. The MIT Press, Cambridge (1989)Hölldobler, S. (ed.): Foundations of Equational Logic Programming. LNCS, vol. 353. Springer, Heidelberg (1989)Meseguer, J., Thati, P.: Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols. Electronic Notes in Theoretical Computer Science 117, 153–182 (2005)Middeldorp, A., Okui, S.: A Deterministic Lazy Narrowing Calculus. Journal of Symbolic Computation 25(6), 733–757 (1998)Nishida, N., Sakai, M., Sakabe, T.: Generation of Inverse Computation Programs of Constructor Term Rewriting Systems. IEICE Transactions on Information and Systems J88–D–I(8), 1171–1183 (2005) (in Japanese)Nishida, N., Sakai, M., Sakabe, T.: Partial Inversion of Constructor Term Rewriting Systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 264–278. Springer, Heidelberg (2005)Nishida, N., Vidal, G.: Program inversion for tail recursive functions. In: Schmidt-Schauß, M. (ed.) Proceedings of the 22nd International Conference on Rewriting Techniques and Applications. LIPIcs, vol. 10, pp. 283–298. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)Nishida, N., Vidal, G.: Computing More Specific Versions of Conditional Rewriting Systems. In: Albert, E. (ed.) LOPSTR 2012. LNCS, vol. 7844, pp. 137–154. Springer, Heidelberg (2013)Nutt, W., Réty, P., Smolka, G.: Basic Narrowing Revisited. Journal of Symbolic Computation 7(3/4), 295–317 (1989)Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, London, UK (2002)Palamidessi, C.: Algebraic Properties of Idempotent Substitutions. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 386–399. Springer, Heidelberg (1990)Ramos, J.G., Silva, J., Vidal, G.: Fast Narrowing-Driven Partial Evaluation for Inductively Sequential Systems. In: Danvy, O., Pierce, B.C. (eds.) Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, pp. 228–239. ACM Press (2005)Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM 21(4), 622–642 (1974

    RAB-5 Controls the Cortical Organization and Dynamics of PAR Proteins to Maintain C. elegans Early Embryonic Polarity

    Get PDF
    In all organisms, cell polarity is fundamental for most aspects of cell physiology. In many species and cell types, it is controlled by the evolutionarily conserved PAR-3, PAR-6 and aPKC proteins, which are asymmetrically localized at the cell cortex where they define specific domains. While PAR proteins define the antero-posterior axis of the early C. elegans embryo, the mechanism controlling their asymmetric localization is not fully understood. Here we studied the role of endocytic regulators in embryonic polarization and asymmetric division. We found that depleting the early endosome regulator RAB-5 results in polarity-related phenotypes in the early embryo. Using Total Internal Reflection Fluorescence (TIRF) microscopy, we observed that PAR-6 is localized at the cell cortex in highly dynamic puncta and depleting RAB-5 decreased PAR-6 cortical dynamics during the polarity maintenance phase. Depletion of RAB-5 also increased PAR-6 association with clathrin heavy chain (CHC-1) and this increase depended on the presence of the GTPase dynamin, an upstream regulator of endocytosis. Interestingly, further analysis indicated that loss of RAB-5 leads to a disorganization of the actin cytoskeleton and that this occurs independently of dynamin activity. Our results indicate that RAB-5 promotes C. elegans embryonic polarity in both dynamin-dependent and -independent manners, by controlling PAR-6 localization and cortical dynamics through the regulation of its association with the cell cortex and the organization of the actin cytoskeleton
    corecore