Steady-state global optimization of metabolic non-linear dynamic models through recasting into power-law canonical models

Background: Design of newly engineered microbial strains for biotechnological purposes would greatly benefit from the development of realistic mathematical models for the processes to be optimized. Such models can then be analyzed and, with the development and application of appropriate optimization techniques, one could identify the modifications that need to be made to the organism in order to achieve the desired biotechnological goal. As appropriate models to perform such an analysis are necessarily non-linear and typically non-convex, finding their global optimum is a challenging task. Canonical modeling techniques, such as Generalized Mass Action (GMA) models based on the power-law formalism, offer a possible solution to this problem because they have a mathematical structure that enables the development of specific algorithms for global optimization. Results: Based on the GMA canonical representation, we have developed in previous works a highly efficient optimization algorithm and a set of related strategies for understanding the evolution of adaptive responses in cellular metabolism. Here, we explore the possibility of recasting kinetic non-linear models into an equivalent GMA model, so that global optimization on the recast GMA model can be performed. With this technique, optimization is greatly facilitated and the results are transposable to the original non-linear problem. This procedure is straightforward for a particular class of non-linear models known as Saturable and Cooperative (SC) models that extend the power-law formalism to deal with saturation and cooperativity. Conclusions: Our results show that recasting non-linear kinetic models into GMA models is indeed an appropriate strategy that helps overcoming some of the numerical difficulties that arise during the global optimization task.

Identifying the preferred subset of enzymatic profiles in nonlinear kinetic metabolic models via multiobjective global optimization and pareto filters

Optimization models in metabolic engineering and systems biology focus typically on optimizing a unique criterion, usually the synthesis rate of a metabolite of interest or the rate of growth. Connectivity and non-linear regulatory effects, however, make it necessary to consider multiple objectives in order to identify useful strategies that balance out different metabolic issues. This is a fundamental aspect, as optimization of maximum yield in a given condition may involve unrealistic values in other key processes. Due to the difficulties associated with detailed non-linear models, analysis using stoichiometric descriptions and linear optimization methods have become rather popular in systems biology. However, despite being useful, these approaches fail in capturing the intrinsic nonlinear nature of the underlying metabolic systems and the regulatory signals involved. Targeting more complex biological systems requires the application of global optimization methods to non-linear representations. In this work we address the multi-objective global optimization of metabolic networks that are described by a special class of models based on the power-law formalism: the generalized mass action (GMA) representation. Our goal is to develop global optimization methods capable of efficiently dealing with several biological criteria simultaneously. In order to overcome the numerical difficulties of dealing with multiple criteria in the optimization, we propose a heuristic approach based on the epsilon constraint method that reduces the computational burden of generating a set of Pareto optimal alternatives, each achieving a unique combination of objectives values. To facilitate the post-optimal analysis of these solutions and narrow down their number prior to being tested in the laboratory, we explore the use of Pareto filters that identify the preferred subset of enzymatic profiles. We demonstrate the usefulness of our approach by means of a case study that optimizes the ethanol production in the fermentation of Saccharomyces cerevisiae.

New insights into cellular prion protein (PrPc) functions: the 'ying and yang' of a relevant protein.

The conversion of cellular prion protein (PrPc), a GPI-anchored protein, into a protease-K-resistant and infective form (generally termed PrPsc) is mainly responsible for Transmissible Spongiform Encephalopathies (TSEs), characterized by neuronal degeneration and progressive loss of basic brain functions. Although PrPc is expressed by a wide range of tissues throughout the body, the complete repertoire of its functions has not been fully determined. Recent studies have confirmed its participation in basic physiological processes such as cell proliferation and the regulation of cellular homeostasis. Other studies indicate that PrPc interacts with several molecules to activate signaling cascades with a high number of cellular effects. To determine PrPc functions, transgenic mouse models have been generated in the last decade. In particular, mice lacking specific domains of the PrPc protein have revealed the contribution of these domains to neurodegenerative processes. A dual role of PrPc has been shown, since most authors report protective roles for this protein while others describe pro-apoptotic functions. In this review, we summarize new findings on PrPc functions, especially those related to neural degeneration and cell signaling.

Establishment and characterization of models of chemotherapy resistance in colorectal cancer: Towards a predictive signature of chemoresistance.

Current standard treatments for metastatic colorectal cancer (CRC) are based on combination regimens with one of the two chemotherapeutic drugs, irinotecan or oxaliplatin. However, drug resistance frequently limits the clinical efficacy of these therapies. In order to gain new insights into mechanisms associated with chemoresistance, and departing from three distinct CRC cell models, we generated a panel of human colorectal cancer cell lines with acquired resistance to either oxaliplatin or irinotecan. We characterized the resistant cell line variants with regards to their drug resistance profile and transcriptome, and matched our results with datasets generated from relevant clinical material to derive putative resistance biomarkers. We found that the chemoresistant cell line variants had distinctive irinotecan- or oxaliplatin-specific resistance profiles, with non-reciprocal cross-resistance. Furthermore, we could identify several new, as well as some previously described, drug resistance-associated genes for each resistant cell line variant. Each chemoresistant cell line variant acquired a unique set of changes that may represent distinct functional subtypes of chemotherapy resistance. In addition, and given the potential implications for selection of subsequent treatment, we also performed an exploratory analysis, in relevant patient cohorts, of the predictive value of each of the specific genes identified in our cellular models.

Factors Affecting the Forecasting Accuracy of Diffusion Models

Tutkielman tavoitteena oli tarkastella innovaatioiden leviämismallien ennustetarkkuuteen vaikuttavia tekijöitä. Tutkielmassa ennustettiin logistisella mallilla matkapuhelinliittymien leviämistä kolmessa Euroopan maassa: Suomessa, Ranskassa ja Kreikassa. Teoriaosa keskittyi innovaatioiden leviämisen ennustamiseen leviämismallien avulla. Erityisesti painotettiin mallien ennustuskykyä ja niiden käytettävyyttä eri tilanteissa. Empiirisessä osassa keskityttiin ennustamiseen logistisella leviämismallilla, joka kalibroitiin eri tavoin koostetuilla aikasarjoilla. Näin tehtyjä ennusteita tarkasteltiin tiedon kokoamistasojen vaikutusten selvittämiseksi. Tutkimusasetelma oli empiirinen, mikä sisälsi logistisen leviämismallin ennustetarkkuuden tutkimista otosdatan kokoamistasoa muunnellen. Leviämismalliin syötettävä data voidaan kerätä kuukausittain ja operaattorikohtaisesti vaikuttamatta ennustetarkkuuteen. Dataan on sisällytettävä leviämiskäyrän käännöskohta, eli pitkän aikavälin huippukysyntäpiste.

Spontaneous cell polarization: Feedback control of Cdc42 GTPase breaks cellular symmetry.

Spontaneous polarization without spatial cues, or symmetry breaking, is a fundamental problem of spatial organization in biological systems. This question has been extensively studied using yeast models, which revealed the central role of the small GTPase switch Cdc42. Active Cdc42-GTP forms a coherent patch at the cell cortex, thought to result from amplification of a small initial stochastic inhomogeneity through positive feedback mechanisms, which induces cell polarization. Here, I review and discuss the mechanisms of Cdc42 activity self-amplification and dynamic turnover. A robust Cdc42 patch is formed through the combined effects of Cdc42 activity promoting its own activation and active Cdc42-GTP displaying reduced membrane detachment and lateral diffusion compared to inactive Cdc42-GDP. I argue the role of the actin cytoskeleton in symmetry breaking is not primarily to transport Cdc42 to the active site. Finally, negative feedback and competition mechanisms serve to control the number of polarization sites.

New insights into cellular prion protein (PrPc) functions: the 'ying and yang' of a relevant protein.

The conversion of cellular prion protein (PrPc), a GPI-anchored protein, into a protease-K-resistant and infective form (generally termed PrPsc) is mainly responsible for Transmissible Spongiform Encephalopathies (TSEs), characterized by neuronal degeneration and progressive loss of basic brain functions. Although PrPc is expressed by a wide range of tissues throughout the body, the complete repertoire of its functions has not been fully determined. Recent studies have confirmed its participation in basic physiological processes such as cell proliferation and the regulation of cellular homeostasis. Other studies indicate that PrPc interacts with several molecules to activate signaling cascades with a high number of cellular effects. To determine PrPc functions, transgenic mouse models have been generated in the last decade. In particular, mice lacking specific domains of the PrPc protein have revealed the contribution of these domains to neurodegenerative processes. A dual role of PrPc has been shown, since most authors report protective roles for this protein while others describe pro-apoptotic functions. In this review, we summarize new findings on PrPc functions, especially those related to neural degeneration and cell signaling.

Methods for construction and analysis of computational models in systems biology : applications to the modelling of the heat shock response and the self-assembly of intermediate filaments

Systems biology is a new, emerging and rapidly developing, multidisciplinary research field that aims to study biochemical and biological systems from a holistic perspective, with the goal of providing a comprehensive, system- level understanding of cellular behaviour. In this way, it addresses one of the greatest challenges faced by contemporary biology, which is to compre- hend the function of complex biological systems. Systems biology combines various methods that originate from scientific disciplines such as molecu- lar biology, chemistry, engineering sciences, mathematics, computer science and systems theory. Systems biology, unlike “traditional” biology, focuses on high-level concepts such as: network, component, robustness, efficiency, control, regulation, hierarchical design, synchronization, concurrency, and many others. The very terminology of systems biology is “foreign” to “tra- ditional” biology, marks its drastic shift in the research paradigm and it indicates close linkage of systems biology to computer science. One of the basic tools utilized in systems biology is the mathematical modelling of life processes tightly linked to experimental practice. The stud- ies contained in this thesis revolve around a number of challenges commonly encountered in the computational modelling in systems biology. The re- search comprises of the development and application of a broad range of methods originating in the fields of computer science and mathematics for construction and analysis of computational models in systems biology. In particular, the performed research is setup in the context of two biolog- ical phenomena chosen as modelling case studies: 1) the eukaryotic heat shock response and 2) the in vitro self-assembly of intermediate filaments, one of the main constituents of the cytoskeleton. The range of presented approaches spans from heuristic, through numerical and statistical to ana- lytical methods applied in the effort to formally describe and analyse the two biological processes. We notice however, that although applied to cer- tain case studies, the presented methods are not limited to them and can be utilized in the analysis of other biological mechanisms as well as com- plex systems in general. The full range of developed and applied modelling techniques as well as model analysis methodologies constitutes a rich mod- elling framework. Moreover, the presentation of the developed methods, their application to the two case studies and the discussions concerning their potentials and limitations point to the difficulties and challenges one encounters in computational modelling of biological systems. The problems of model identifiability, model comparison, model refinement, model inte- gration and extension, choice of the proper modelling framework and level of abstraction, or the choice of the proper scope of the model run through this thesis.

Cytoskeletal and cellular adhesion proteins in zebrafish (Danio rerio) myogenesis

The current myogenesis and myofibrillogenesis model has been based mostly on in vitro cell culture studies, and, to a lesser extent, on in situ studies in avian and mammalian embryos. While the more isolated artificial conditions of cells in culture permitted careful structural analysis, the actual in situ cellular structures have not been described in detail because the embryos are more difficult to section and manipulate. To overcome these difficulties, we used the optically clear and easy to handle embryos of the zebrafish Danio rerio. We monitored the expression of cytoskeletal and cell-adhesion proteins (actin, myosin, desmin, alpha-actinin, troponin, titin, vimentin and vinculin) using immunofluorescence microscopy and video-enhanced, background-subtracted, differential interference contrast of 24- to 48-h zebrafish embryos. In the mature myotome, the mononucleated myoblasts displayed periodic striations for all sarcomeric proteins tested. The changes in desmin distribution from aggregates to perinuclear and striated forms, although following the same sequence, occurred much faster than in other models. All desmin-positive cells were also positive for myofibrillar proteins and striated, in contrast to that which occurs in cell cultures. Vimentin appeared to be striated in mature cells, while it is developmentally down-regulated in vitro. The whole connective tissue septum between the somites was positive for adhesion proteins such as vinculin, instead of the isolated adhesion plaques observed in cell cultures. The differences in the myogenesis of zebrafish in situ and in cell culture in vitro suggest that some of the previously observed structures and protein distributions in cultures could be methodological artifacts.

CaMKIIdelta overexpression in hypertrophy and heart failure: cellular consequences for excitation-contraction coupling

Ca/calmodulin-dependent protein kinase IIdelta (CaMKIIdelta) is the predominant isoform in the heart. During excitation-contraction coupling (ECC) CaMKII phosphorylates several Ca-handling proteins including ryanodine receptors (RyR), phospholamban, and L-type Ca channels. CaMKII expression and activity have been shown to correlate positively with impaired ejection fraction in the myocardium of patients with heart failure and CaMKII has been proposed to be a possible compensatory mechanism to keep hearts from complete failure. However, in addition to these acute effects on ECC, CaMKII was shown to be involved in hypertrophic signaling, termed excitation-transcription coupling (ETC). Thus, animal models have shown that overexpression of nuclear isoform CaMKIIdeltaB can induce myocyte hypertrophy. Recent study from our laboratory has suggested that transgenic overexpression of the cytosolic isoform CaMKIIdeltaC in mice causes severe heart failure with altered intracellular Ca handling and protein expression leading to reduced sarcoplasmic reticulum (SR) Ca content. Interestingly, the frequency of diastolic spontaneous SR Ca release events (or opening of RyR) was greatly enhanced, demonstrating increased diastolic SR Ca leak. This was attributed to increased CaMKII-dependent RyR phosphorylation, resulting in increased and prolonged openings of RyR since Ca spark frequency could be reduced back to normal levels by CaMKII inhibition. This review focuses on acute and chronic effects of CaMKII in ECC and ETC. In summary, CaMKII overexpression can lead to heart failure and CaMKII-dependent RyR hyperphosphorylation seems to be a novel and important mechanism in ECC due to SR Ca leak which may be important in the pathogenesis of heart failure.

Molecular and cellular pathogenesis of autosomal recessive polycystic kidney disease

Autosomal recessive polycystic kidney disease (ARPKD) is an inherited disease characterized by a malformation complex which includes cystically dilated tubules in the kidneys and ductal plate malformation in the liver. The disorder is observed primarily in infancy and childhood, being responsible for significant pediatric morbidity and mortality. All typical forms of ARPKD are caused by mutations in a single gene, PKHD1 (polycystic kidney and hepatic disease 1). This gene has a minimum of 86 exons, assembled into multiple differentially spliced transcripts and has its highest level of expression in kidney, pancreas and liver. Mutational analyses revealed that all patients with both mutations associated with truncation of the longest open reading frame-encoded protein displayed the severe phenotype. This product, polyductin, is a 4,074-amino acid protein expressed in the cytoplasm, plasma membrane and primary apical cilia, a structure that has been implicated in the pathogenesis of different polycystic kidney diseases. In fact, cholangiocytes isolated from an ARPKD rat model develop shorter and dysmorphic cilia, suggesting polyductin to be important for normal ciliary morphology. Polyductin seems also to participate in tubule morphogenesis and cell mitotic orientation along the tubular axis. The recent advances in the understanding of in vitro and animal models of polycystic kidney diseases have shed light on the molecular and cellular mechanisms of cyst formation and progression, allowing the initiation of therapeutic strategy designing and promising perspectives for ARPKD patients. It is notable that vasopressin V2 receptor antagonists can inhibit/halt the renal cystic disease progression in an orthologous rat model of human ARPKD.

Automates à contraintes semilinéaires = Automata with a semilinear constraint

Cette thèse présente une étude dans divers domaines de l'informatique théorique de modèles de calculs combinant automates finis et contraintes arithmétiques. Nous nous intéressons aux questions de décidabilité, d'expressivité et de clôture, tout en ouvrant l'étude à la complexité, la logique, l'algèbre et aux applications. Cette étude est présentée au travers de quatre articles de recherche. Le premier article, Affine Parikh Automata, poursuit l'étude de Klaedtke et Ruess des automates de Parikh et en définit des généralisations et restrictions. L'automate de Parikh est un point de départ de cette thèse; nous montrons que ce modèle de calcul est équivalent à l'automate contraint que nous définissons comme un automate qui n'accepte un mot que si le nombre de fois que chaque transition est empruntée répond à une contrainte arithmétique. Ce modèle est naturellement étendu à l'automate de Parikh affine qui effectue une opération affine sur un ensemble de registres lors du franchissement d'une transition. Nous étudions aussi l'automate de Parikh sur lettres: un automate qui n'accepte un mot que si le nombre de fois que chaque lettre y apparaît répond à une contrainte arithmétique. Le deuxième article, Bounded Parikh Automata, étudie les langages bornés des automates de Parikh. Un langage est borné s'il existe des mots w_1, w_2, ..., w_k tels que chaque mot du langage peut s'écrire w_1...w_1w_2...w_2...w_k...w_k. Ces langages sont importants dans des domaines applicatifs et présentent usuellement de bonnes propriétés théoriques. Nous montrons que dans le contexte des langages bornés, le déterminisme n'influence pas l'expressivité des automates de Parikh. Le troisième article, Unambiguous Constrained Automata, introduit les automates contraints non ambigus, c'est-à-dire pour lesquels il n'existe qu'un chemin acceptant par mot reconnu par l'automate. Nous montrons qu'il s'agit d'un modèle combinant une meilleure expressivité et de meilleures propriétés de clôture que l'automate contraint déterministe. Le problème de déterminer si le langage d'un automate contraint non ambigu est régulier est montré décidable. Le quatrième article, Algebra and Complexity Meet Contrained Automata, présente une étude des représentations algébriques qu'admettent les automates contraints et les automates de Parikh affines. Nous déduisons de ces caractérisations des résultats d'expressivité et de complexité. Nous montrons aussi que certaines hypothèses classiques en complexité computationelle sont reliées à des résultats de séparation et de non clôture dans les automates de Parikh affines. La thèse est conclue par une ouverture à un possible approfondissement, au travers d'un certain nombre de problèmes ouverts.

Restarting automata with restricted utilization of auxiliary symbols

The restarting automaton is a restricted model of computation that was introduced by Jancar et al. to model the so-called analysis by reduction, which is a technique used in linguistics to analyze sentences of natural languages. The most general models of restarting automata make use of auxiliary symbols in their rewrite operations, although this ability does not directly correspond to any aspect of the analysis by reduction. Here we put restrictions on the way in which restarting automata use auxiliary symbols, and we investigate the influence of these restrictions on their expressive power. In fact, we consider two types of restrictions. First, we consider the number of auxiliary symbols in the tape alphabet of a restarting automaton as a measure of its descriptional complexity. Secondly, we consider the number of occurrences of auxiliary symbols on the tape as a dynamic complexity measure. We establish some lower and upper bounds with respect to these complexity measures concerning the ability of restarting automata to recognize the (deterministic) context-free languages and some of their subclasses.

CD-Systems of Restarting Automata

Die vorliegende Arbeit behandelt Restartautomaten und Erweiterungen von Restartautomaten. Restartautomaten sind ein Werkzeug zum Erkennen formaler Sprachen. Sie sind motiviert durch die linguistische Methode der Analyse durch Reduktion und wurden 1995 von Jancar, Mráz, Plátek und Vogel eingeführt. Restartautomaten bestehen aus einer endlichen Kontrolle, einem Lese/Schreibfenster fester Größe und einem flexiblen Band. Anfänglich enthält dieses sowohl die Eingabe als auch Bandbegrenzungssymbole. Die Berechnung eines Restartautomaten läuft in so genannten Zyklen ab. Diese beginnen am linken Rand im Startzustand, in ihnen wird eine lokale Ersetzung auf dem Band durchgeführt und sie enden mit einem Neustart, bei dem das Lese/Schreibfenster wieder an den linken Rand bewegt wird und der Startzustand wieder eingenommen wird. Die vorliegende Arbeit beschäftigt sich hauptsächlich mit zwei Erweiterungen der Restartautomaten: CD-Systeme von Restartautomaten und nichtvergessende Restartautomaten. Nichtvergessende Restartautomaten können einen Zyklus in einem beliebigen Zustand beenden und CD-Systeme von Restartautomaten bestehen aus einer Menge von Restartautomaten, die zusammen die Eingabe verarbeiten. Dabei wird ihre Zusammenarbeit durch einen Operationsmodus, ähnlich wie bei CD-Grammatik Systemen, geregelt. Für beide Erweiterungen zeigt sich, dass die deterministischen Modelle mächtiger sind als deterministische Standardrestartautomaten. Es wird gezeigt, dass CD-Systeme von Restartautomaten in vielen Fällen durch nichtvergessende Restartautomaten simuliert werden können und andererseits lassen sich auch nichtvergessende Restartautomaten durch CD-Systeme von Restartautomaten simulieren. Des Weiteren werden Restartautomaten und nichtvergessende Restartautomaten untersucht, die nichtdeterministisch sind, aber keine Fehler machen. Es zeigt sich, dass diese Automaten durch deterministische (nichtvergessende) Restartautomaten simuliert werden können, wenn sie direkt nach der Ersetzung einen neuen Zyklus beginnen, oder ihr Fenster nach links und rechts bewegen können. Außerdem gilt, dass alle (nichtvergessenden) Restartautomaten, die zwar Fehler machen dürfen, diese aber nach endlich vielen Zyklen erkennen, durch (nichtvergessende) Restartautomaten simuliert werden können, die keine Fehler machen. Ein weiteres wichtiges Resultat besagt, dass die deterministischen monotonen nichtvergessenden Restartautomaten mit Hilfssymbolen, die direkt nach dem Ersetzungsschritt den Zyklus beenden, genau die deterministischen kontextfreien Sprachen erkennen, wohingegen die deterministischen monotonen nichtvergessenden Restartautomaten mit Hilfssymbolen ohne diese Einschränkung echt mehr, nämlich die links-rechts regulären Sprachen, erkennen. Damit werden zum ersten Mal Restartautomaten mit Hilfssymbolen, die direkt nach dem Ersetzungsschritt ihren Zyklus beenden, von Restartautomaten desselben Typs ohne diese Einschränkung getrennt. Besonders erwähnenswert ist hierbei, dass beide Automatentypen wohlbekannte Sprachklassen beschreiben.

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS), which both are useful models in computational linguistics. For PCGSs we study two complexity measures called 'generation complexity' and 'distribution complexity', and we prove that a PCGS Pi, for which the generation complexity and the distribution complexity are both bounded by constants, can be transformed into a freely rewriting restarting automaton of a very restricted form. From this characterization it follows that the language L(Pi) generated by Pi is semi-linear, that its characteristic analysis is of polynomial size, and that this analysis can be computed in polynomial time.