Ovarian cancer (OC) has the highest mortality among gynecological cancers. The high mortality is associated with the lack of an accurate screening tool to detect disease in early stage. As a result the majority of OCs are diagnosed in late stage. Further, the molecular events responsible for malignant transformation in the ovary remain poorly understood. Consequently, delineating key molecular players driving OC could help elucidate potential diagnostic, prognostic and therapeutic targets. Receptor for hyaluronan-mediated motility (RHAMM) belongs to a group of hyaladherins, which share a common ability to bind to hyaluronan (HA). Intracellularly, RHAMM is involved in microtubule spindle assembly contributing to cell cycle progression. On the cell surface, loosely tethered RHAMM forms a complex with cluster differentiation 44 and HA to activate cell signaling pathways that promote cellular migration, invasion and proliferation. Since RHAMM is overexpressed in a number of cancer types and it is often associated with an aggressive cancer phenotype, I sought to determine if RHAMM similarly contributes to OC. I found that RHAMM is overexpressed in clinical specimens of OC by immuno-histochemistry and although both primary and metastatic OCs stain equally for RHAMM, RHAMM staining was most intense among clinically aggressive OC histologic subtypes. Further, using an in vitro model system, I was able to show that OC cells express and secrete RHAMM. Abrogation of RHAMM using silencing RNA technology inhibited OC cell migration and invasion suggesting that RHAMM may contribute, at least in part, to the metastatic propensity of OC. Since RHAMM lacks an export signal peptide sequence and has not been reported to employ alternate mechanisms for extracellular secretion, I utilized computational analyses to predict post-translational glycosylation events as a novel mode for RHAMM secretion. N- glycosylation inhibitors abrogated RHAMM secretion by OC cells in vitro validating my prediction and identify a novel and potentially unconventional mode for RHAMM secretion. Lastly, since RHAMM is secreted by OC cells, I sought to determine whether RHAMM could be detected in bodily fluids. In a pilot study, I found that urinary levels of RHAMM are elevated in OC patients as measured by enzyme-linked immunosorbant assays. Decreased urinary RHAMM levels noted following cytoreductive surgery support OC as the source of elevated urinary RHAMM levels. Finally, while obesity was associated with high urinary RHAMM levels in OC patients, combined measurements of urinary RHAMM and serum CA125 improved prediction of OC. Taken together, the studies described herein suggest that RHAMM contributes to OC and that further studies are warranted to further elucidate the clinical role of RHAMM in OC.

L'étude de la dynamique des réseaux de réactions est un enjeu majeur de la biologie des systèmes. Cela peut-être réalisé de deux manières : soit de manière déterministe à l'aide d'équations différentielles, soit de manière probabiliste à l'aide de chaînes de Markov. Dans les deux cas, un problème majeur est celui de la détermination des lois cinétiques impliquées et l'inférence de paramètres cinétiques associés. Pour cette raison, l'étude directe de grands réseaux de réactions est impossible. Dans le cas de la modélisation déterministe, ce problème peut-être contourné à l'aide d'une analyse stationnaire du réseau. Une méthode connue est celle de l'analyse des flux à l'équilibre (FBA) qui permet d'obtenir des systèmes de contraintes à partir d'informations sur les pentes moyennes des trajectoires. Le but de cette thèse est d'introduire une méthode analogue dans le cas de la modélisation probabiliste. Les résultats de la thèse se divisent en trois parties. Tout d'abord on présente une analyse stationnaire de la modélisation probabiliste reposant sur une approximation de Bernoulli. Dans un deuxième temps, cette dynamique approximée nous permet d'établir des systèmes de contraintes à l'aide d'informations obtenues sur les moyennes, les variances et les co-variances des trajectoires du système. Enfin, on présente plusieurs applications à ces systèmes de contraintes telles que la possibilité de réfuter des réseaux de réactions à l'aide d'informations de variances ou de co-variances et la vérification formelle de propriétés logiques sur le régime stationnaire du système. / A major goal in systems biology is to inverstigate the dynamical behavior of reaction networks. There exists two main dynamical frameworks : the first one is the deterministic dynamics where the dynamics is described using odinary differential equations, the second one is probabilistic and relies on Markov chains. In both cases, one major issue is to determine the kinetic laws of the systems together with its kinetic parameters. As a consequence the direct study of large biological reaction networks is impossible. To deal with this issue, stationnary assumptions have been used. A widely used method is flux balance analysis, where systems of constraints are derived from information on the average slopes of the system trajectories. In this thesis, we construct a probabilistic analog of this stationnary analysis. The results are divided into three parts. First, we introduce a stationnary analysis of the probabilistic dynamics which relies on a Bernoulli approximation. Second, this approximated dynamics allows us to derive systems of constraints from information about the means, variances and co-variances of the system trajectories. Third, we present several applications of these systems of constraints such as the possibility to reject reaction networks using information from experimental variances and co-variances and the formal verification of logical properties concerning the stationnary regime of the system.

Massively parallel high throughput sequencers are transforming the scientific research by reducing the cost and time necessary to sequence entire genomes. The goal of this project is to produce preliminary genome assemblies of calliphorid flies using Life Technologies’ Ion Torrent sequencing and Illumina’s MiSeq sequencing. I located, assembled, and annotated a novel mitochondrial genome for one such fly, the little studied Chrysomya pacifica that is central to one hypothesis about blow fly evolution. With sequencing data from Chrysomya megacephala, its forensically relevant sister species, much insight can be gained by alignments, sequence and protein analysis, and many more tools within the CLC Genomics Workbench software program. I present these analyses here of these recently diverged species.

Uma das tarefas mais básicas em bioinformática é a comparação de seqüências feita por algoritmos de alinhamento, que modelam as alterações evolutivas nas seqüências biológicas através de mutações como inserção, remoção e substituição de símbolos. Este trabalho trata de generalizações nos algoritmos de alinhamento que levam em consideração outras mutações conhecidas como rearranjos, mais especificamente, inversões, duplicações em tandem e duplicações por transposição. Alinhamento com inversões não tem um algoritmo polinomial conhecido e uma simplificação para o problema que considera somente inversões não sobrepostas foi proposta em 1992 por Schöniger e Waterman. Em 2003, dois trabalhos independentes propuseram algoritmos com tempo O(n^4) para alinhar duas seqüências com inversões não sobrepostas. Desenvolvemos dois algoritmos que resolvem este mesmo problema: um com tempo de execução O(n^3 logn) e outro que, sob algumas condições no sistema de pontuação, tem tempo de execução O(n^3), ambos em memória O(n^2). Em 1997, Benson propôs um modelo de alinhamento que reconhecesse as duplicações em tandem além das inserções, remoções e substituições. Ele propôs dois algoritmos exatos para alinhar duas seqüências com duplicações em tandem: um em tempo O(n^5) e memória O(n^2), e outro em tempo O(n^4) e memória O(n^3). Propomos um algoritmo para alinhar duas seqüências com duplicações em tandem em tempo O(n^3) e memória O(n^2). Propomos também um algoritmo para alinhar duas seqüências com transposons (um tipo mais geral que a duplicação em tandem), em tempo O(n^3) e memória O(n^2). / Sequence comparison done by alignment algorithms is one of the most fundamental tasks in bioinformatics. The evolutive mutations considered in these alignments are insertions, deletions and substitutions of nucleotides. This work treats of generalizations introduced in alignment algorithms in such a way that other mutations known as rearrangements are also considered, more specifically, we consider inversions, duplications in tandem and duplications by transpositions. Alignment with inversions does not have a known polynomial algorithm and a simplification to the problem that considers only non-overlapping inversions were proposed by Schöniger and Waterman in 1992. In 2003, two independent works proposed algorithms with O(n^4) time to align two sequences with non-overlapping inversions. We developed two algorithms to solve this problem: one in O(n^3 log n) time and other, considering some conditions in the scoring system, in O(n^3) time, both in O(n^2) memory. In 1997, Benson proposed a model of alignment that recognized tandem duplication, insertion, deletion and substitution. He proposed two exact algorithms to align two sequences with tandem duplication: one in O(n^5) time and O(n^2) memory, and other in O(n^4) time and O(n^3) memory. We propose one algorithm to align two sequences with tandem duplication in O(n^3) time and O(n^2) memory. We also propose one algorithm to align two sequences with transposons (a type of duplication more general than tandem duplication), in O(n^3) time and O(n^2) memory.

Single-cell RNA sequencing and in situ sequencing were combined in a recent study of the developing human heart to explore the transcriptional landscape at three developmental stages. However, the method used in the study to create the spatial cellular maps has some limitations. It relies on image segmentation of the nuclei and cell types defined in advance by single-cell sequencing. In this study, we applied a new unsupervised approach based on graph neural networks on the in situ sequencing data of the human heart to find spatial gene expression patterns and detect novel cell and sub-cell types. In this thesis, we first introduce some relevant background knowledge about the sequencing techniques that generate our data, machine learning in single-cell analysis, and deep learning on graphs. We have explored several graph neural network models and algorithms to learn embeddings for spatial gene expression. Dimensionality reduction and cluster analysis were performed on the embeddings for visualization and identification of biologically functional domains. Based on the cluster gene expression profiles, locations of the clusters in the heart sections, and comparison with cell types defined in the previous study, the results of our experiments demonstrate that graph neural networks can learn meaningful representations of spatial gene expression in the human heart. We hope further validations of our clustering results could give new insights into cell development and differentiation processes of the human heart.

Epigenetic changes (specifically DNA methylation) have been associated with adverse health outcomes; however, unlike genetic markers that are fixed over the lifetime of an individual, methylation can change. Given that there are a large number of methylation sites, measuring them repeatedly introduces multiple testing problems beyond those that exist in a static genetic context. Using simulations of epigenetic data, we considered different methods of controlling the false discovery rate. We considered several underlying associations between an exposure and methylation over time. We found that testing each site with a linear mixed effects model and then controlling the false discovery rate (FDR) had the highest positive predictive value (PPV), a low number of false positives, and was able to differentiate between differential methylation that was present at only one time point vs. a persistent relationship. In contrast, methods that controlled FDR at a single time point and ad hoc methods tended to have lower PPV, more false positives, and/or were unable to differentiate these conditions. Validation in data obtained from Project Viva found a difference between fitting longitudinal models only to sites significant at one time point and fitting all sites longitudinally.

APOBEC3s (A3s) are a family of human cytidine deaminases that play important roles in both innate immunity and cancer. A3s protect host cells against retroviruses and retrotransposons by deaminating cytosine to uracil on foreign pathogenic genomes. However, when mis-regulated, A3s can cause heterogeneities in host genome and thus promote cancer and the development of therapeutic resistance. The family consists of seven members with either one (A3A, A3C and A3H) or two zinc-binding domains (A3B, A3D, A3D and A3G). Despite overall similarity, A3 proteins have distinct deamination activity and substrate specificity. Over the past years, several crystal and NMR structures of apo A3s and DNA/RNA-bound A3s have been determined. These structures have suggested the importance of the loops around the active site for nucleotide specificity and binding. However, the structural mechanism underlying A3 activity and substrate specificity requires further examination. Using a combination of computational molecular modeling and parallel molecular dynamics (pMD) simulations followed by experimental verifications, I investigated the roles of active site residues and surrounding loops in determining the substrate specificity and RNA versus DNA binding among A3s. Starting with A3B, I revealed the structural basis and gatekeeper residue for DNA binding. I also identified a unique auto-inhibited conformation in A3B that restricts access to the active site and may underlie lower catalytic activity compared to the highly similar A3A. Besides, I investigated the structural mechanism of substrate specificity and ssDNA binding conformation in A3s. I found an interdependence between substrate conformation and specificity. Specifically, the linear DNA conformation helps accommodate CC dinucleotide motif while the U-shaped conformation prefers TC. I also identified the molecular mechanisms of substrate sequence specificity at -1’ and -2’ positions. Characterization of substrate binding to A3A revealed that intra-DNA interactions may be responsible for the specificity in A3A. Finally, I investigated the structural mechanism for exclusion of RNA from A3G catalytic activity using similar methods. Overall, the comprehensive analysis of A3s in this thesis shed light into the structural mechanism of substrate specificity and broaden the understanding of molecular interactions underlying the biological function of these enzymes. These results have implications for designing specific A3 inhibitors as well as base editing systems for gene therapy.

Protein-protein interaction dominates all major biology processes in living cells. Recent studies suggestthat the surface expression and activity of G protein-coupled receptors (GPCRs), which are the largestfamily of receptors in human cells, can be modulated by receptor activity–modifying proteins (RAMPs). Computational tools are essential to complement experimental approaches for the understanding ofmolecular activity of living cells and molecular dynamics simulations are well suited to providemolecular details of proteins function and structure. The classical atom-level molecular modeling ofbiological systems is limited to small systems and short time scales. Therefore, its application iscomplicated for systems such as protein-protein interaction in cell-surface membrane. For this reason, coarse-grained (CG) models have become widely used and they represent an importantstep in the study of large biomolecular systems. CG models are computationally more effective becausethey simplify the complexity of the protein structure allowing simulations to have longer timescales. The aim of this degree project was to determine if the applications of coarse-grained molecularsimulations were suitable for the understanding of the dynamics and structural basis of the GPCRRAMP interactions in a membrane environment. Results indicate that the study of protein-proteininteractions using CG needs further improvement with a more accurate parameterization that will allowthe study of complex systems.

Basal Ganglia are evolutionarily conserved brain nuclei involved in several physiologically important animal behaviors like motor control and reward learning. Striatum, which is the input nuclei of basal ganglia, integrates inputs from several neurons, like cortical and thalamic glutamatergic input and local GABAergic inputs. Several neuromodulators, such as dopamine, accetylcholine and serotonin modulate the functional properties of striatal neurons. Aberrations in the intracellular signaling of these neurons lead to several debilitating neurodegenerative diseases, like Parkinson’s disease. In order to understand these aberrations we should first identify the role of different molecular players in the normal physiology. The long term goal of this research is to understand the molecular mechanisms responsible for the integration of different neuromodulatory signals by striatal medium spiny neurons (MSN). This signal integration is known to play important role in learning. This is manifested via changes in the synaptic weights between different neurons. The group of synpases taken into consideration for the current work is the corticostriatal one, which are synapses between the cortical projection neurons and MSNs. One of the molecular processes of considerable interest is the interaction between dopaminergic and cholinergic inputs. In this thesis I have investigated the interactions between the biochemical cascades triggered by dopaminergic, cholinergic (ACh) and glutamatergic inputs to the striatal MSN. The dopamine induced signaling increases the levels of cAMP in the striatonigral MSNs. The sources of dopamine and acetylcholine are dopaminergic neurons (DAN) from midbrain and tonically active cholinergic interneurons (TAN) of striatum, respectively. A sub-second burst activity in DAN along with a simultaneous pause in TAN is a characteristic effect elicited by a salient stimulus. This, in turn, leads to a dopamine peak and, possibly, an acetylcholine (ACh) dip in striatum. I have looked into the possibility of sensing this ACh dip and the dopamine peak at striatonigral MSNs. These neurons express D1 dopamine receptor (D1R) coupled to Golf and M4 Muscarinic receptor (M4R) coupled to Gi/o . These receptors are expressed significantly in the dendritic spines of these neurons where the Adenylate Cyclase 5 (AC5) is a point of convergence for these two signals. Golf stimulates the production of cAMP by AC5 whereas Gi/o inhibits the Golf mediated cAMP production. I have performed a kinetic-modeling exercise to explore how dopamine and ACh interacts with each other via these receptors and what are the effects on the downstream signaling events. The results of model simulation suggest that the striatonigral MSNs are able to sense the ACh dip via M4R. They integrate the dip with the dopamine peak to activate AC5 synergistically. We also found that the ACh tone may act as a potential noise filter against noisy dopamine signals. The parameters for the G-protein GTPase activity indicate towards an important role of GTPase Activating Proteins (GAPs), like RGS, in this process. Besides this we also hypothesize that M4R may have therapeutic potential. / <p>QC 20140325</p>

Parameter inference for stochastic systems is considered as one of the fundamental classical problems in the domain of computational systems biology. The problem becomes challenging and often analytically intractable with the large number of uncertain parameters. In this scenario, Markov Chain Monte Carlo (MCMC) algorithms have been proved to be highly effective. For a stochastic system, the most accurate description of the kinetics is given by the Chemical Master Equation (CME). Unfortunately, analytical solution of CME is often intractable even for considerably small amount of chemically reacting species due to its super exponential state space complexity. As a solution, Stochastic Simulation Algorithm (SSA) using Monte Carlo approach was introduced to simulate the chemical process defined by the CME. SSA is an exact stochastic method to simulate CME but it also suffers from high time complexity due to simulation of every reaction. Therefore computation of likelihood function (based on exact CME) in MCMC becomes expensive which alternately makes the rejection step expensive. In this generic work, we introduce different approximations of CME as a pre-conditioning step to the full MCMC to make rejection cheaper. The goal is to avoid expensive computation of exact CME as far as possible. We show that, with effective pre-conditioning scheme, one can save a considerable amount of exact CME computations maintaining similar convergence characteristics. Additionally, we investigate three different sampling schemes (dense sampling, longer sampling and i.i.d sampling) under which convergence for MCMC using exact CME for parameter estimation can be analyzed. We find that under i.i.d sampling scheme, better convergence can be achieved than that of dense sampling of the same process or sampling the same process for longer time. We verify our theoretical findings for two different processes: linear birth-death and dimerization.Apart from providing a framework for parameter inference using CME, this work also provides us the reasons behind avoiding CME (in general) as a parameter estimation technique for so long years after its formulation