Context-specific independence in graphical models

The theme of this thesis is context-speci c independence in graphical models. Considering a system of stochastic variables it is often the case that the variables are dependent of each other. This can, for instance, be seen by measuring the covariance between a pair of variables. Using graphical models, it is possible to visualize the dependence structure found in a set of stochastic variables. Using ordinary graphical models, such as Markov networks, Bayesian networks, and Gaussian graphical models, the type of dependencies that can be modeled is limited to marginal and conditional (in)dependencies. The models introduced in this thesis enable the graphical representation of context-speci c independencies, i.e. conditional independencies that hold only in a subset of the outcome space of the conditioning variables. In the articles included in this thesis, we introduce several types of graphical models that can represent context-speci c independencies. Models for both discrete variables and continuous variables are considered. A wide range of properties are examined for the introduced models, including identi ability, robustness, scoring, and optimization. In one article, a predictive classi er which utilizes context-speci c independence models is introduced. This classi er clearly demonstrates the potential bene ts of the introduced models. The purpose of the material included in the thesis prior to the articles is to provide the basic theory needed to understand the articles.

Structural and Computational Existence Results for Multidimensional Subshifts

Symbolic dynamics is a branch of mathematics that studies the structure of infinite sequences of symbols, or in the multidimensional case, infinite grids of symbols. Classes of such sequences and grids defined by collections of forbidden patterns are called subshifts, and subshifts of finite type are defined by finitely many forbidden patterns. The simplest examples of multidimensional subshifts are sets of Wang tilings, infinite arrangements of square tiles with colored edges, where adjacent edges must have the same color. Multidimensional symbolic dynamics has strong connections to computability theory, since most of the basic properties of subshifts cannot be recognized by computer programs, but are instead characterized by some higher-level notion of computability. This dissertation focuses on the structure of multidimensional subshifts, and the ways in which it relates to their computational properties. In the first part, we study the subpattern posets and Cantor-Bendixson ranks of countable subshifts of finite type, which can be seen as measures of their structural complexity. We show, by explicitly constructing subshifts with the desired properties, that both notions are essentially restricted only by computability conditions. In the second part of the dissertation, we study different methods of defining (classes of ) multidimensional subshifts, and how they relate to each other and existing methods. We present definitions that use monadic second-order logic, a more restricted kind of logical quantification called quantifier extension, and multi-headed finite state machines. Two of the definitions give rise to hierarchies of subshift classes, which are a priori infinite, but which we show to collapse into finitely many levels. The quantifier extension provides insight to the somewhat mysterious class of multidimensional sofic subshifts, since we prove a characterization for the class of subshifts that can extend a sofic subshift into a nonsofic one.

Sphingosine-1-phosphate-evoked invasion of follicular thyroid cancer cells : evidence for the involvement of HIF-Iα, MMP2 and MMP9

Sphingolipids are widely expressed molecules, which traditionally were considered to have majorly structural properties. Nowadays, however, they are implicated in a wide range of different biological processes. The bioactive lipid sphingosine 1-phosphate (S1P) has emerged during the past decade as one of the most studied molecules due to its proliferative and pro-migratory abilities both during normal physiology and in the pathology of a subset of different diseases. Migration and invasion of cancer cells require changes in cell behavior and modulation of the tissue microenvironment. Tumor aggressiveness is markedly enhanced by hypoxia, in which hypoxia inducible transcription factors 1-2α (HIF-1-2α) are activated to promote metabolism, proliferation and migration. Invasion requires degradation of the extracellular matrix (ECM) achieved by several degrading and remodeling enzymes. Matrix metalloproteinases (MMPs) are broadly expressed and well accepted as proteolytic enzymes with essential roles both in normal physiology and in pathology. Previously, S1P was shown to strongly evoke migration of follicular ML-1 thyroid cancer cells. The objective of this study was to further investigate and understand the mechanisms behind this regulation. In the first project it was demonstrated that S1P enhances the expression and activity of HIF-1α. S1P enhanced the expression of HIF-1α by increasing its synthesis and stability. The S1P-increased HIF-1α was mediated via S1P3, Gi/0, PI3K, PKCβI, ERK1/2, mTOR and translation factors p70S6K and eIF4E. Finally, it was shown that HIF-1α mediated S1P-induced migration. The ECM is constituted of a complex and coordinated assembly of many types of proteins. In order to be able to invade, cells need to break down the ECM, therefore several key players in this event were investigated in the second project. S1P increased the secretion and activity of MMP2 and MMP9 via S1P-receptor 1 and 3 and that these MMPs participated in the S1P-facilitated invasion of ML-1 cells. In this interplay, calpains and Rac1 were involved, both of which are crucial players in migration and invasion. The prognosis for some types of thyroid cancer is relatively good. However, there are forms of thyroid cancers, for which there are no treatments or the current available treatments are inefficient. Thus, new medical interventions are urgently needed. In the third project the significance of the S1P-receptor modulating drug FTY720, which is currently used for the treatment of multiple sclerosis (MS), was studied. The effect of FTY720 was tested on several thyroid cancer cell lines, and it inhibited the proliferation and invasion of all cancer cell lines tested. In ML-1 cells, FTY720 attenuated invasion by blocking signaling intermediates important for migration and invasion of the cells. Moreover, FTY720 inhibited the proliferation of ML-1 cells by increasing the expression of p21 and p27, hence, inducing cell arrest in G1 phase of the cell cycle. Thus, it can be suggested that FTY720 could be used in the treatment of thyroid cancer.

Adopting the Vaadin Java framework to rebuild VTT’s Web Interfaces and Database Applications

With the growth in new technologies, using online tools have become an everyday lifestyle. It has a greater impact on researchers as the data obtained from various experiments needs to be analyzed and knowledge of programming has become mandatory even for pure biologists. Hence, VTT came up with a new tool, R Executables (REX) which is a web application designed to provide a graphical interface for biological data functions like Image analysis, Gene expression data analysis, plotting, disease and control studies etc., which employs R functions to provide results. REX provides a user interactive application for the biologists to directly enter the values and run the required analysis with a single click. The program processes the given data in the background and prints results rapidly. Due to growth of data and load on server, the interface has gained problems concerning time consumption, poor GUI, data storage issues, security, minimal user interactive experience and crashes with large amount of data. This thesis handles the methods by which these problems were resolved and made REX a better application for the future. The old REX was developed using Python Django and now, a new programming language, Vaadin has been implemented. Vaadin is a Java framework for developing web applications and the programming language is extremely similar to Java with new rich components. Vaadin provides better security, better speed, good and interactive interface. In this thesis, subset functionalities of REX was selected which includes IST bulk plotting and image segmentation and implemented those using Vaadin. A code of 662 lines was programmed by me which included Vaadin as the front-end handler while R language was used for back-end data retrieval, computing and plotting. The application is optimized to allow further functionalities to be migrated with ease from old REX. Future development is focused on including Hight throughput screening functions along with gene expression database handling

Efficient Algorithms for Coastal Geographic Problems

The increasing performance of computers has made it possible to solve algorithmically problems for which manual and possibly inaccurate methods have been previously used. Nevertheless, one must still pay attention to the performance of an algorithm if huge datasets are used or if the problem iscomputationally difficult. Two geographic problems are studied in the articles included in this thesis. In the first problem the goal is to determine distances from points, called study points, to shorelines in predefined directions. Together with other in-formation, mainly related to wind, these distances can be used to estimate wave exposure at different areas. In the second problem the input consists of a set of sites where water quality observations have been made and of the results of the measurements at the different sites. The goal is to select a subset of the observational sites in such a manner that water quality is still measured in a sufficient accuracy when monitoring at the other sites is stopped to reduce economic cost. Most of the thesis concentrates on the first problem, known as the fetch length problem. The main challenge is that the two-dimensional map is represented as a set of polygons with millions of vertices in total and the distances may also be computed for millions of study points in several directions. Efficient algorithms are developed for the problem, one of them approximate and the others exact except for rounding errors. The solutions also differ in that three of them are targeted for serial operation or for a small number of CPU cores whereas one, together with its further developments, is suitable also for parallel machines such as GPUs.