MAM Doctoral thesis defenses and Licentiate thesis seminars

Research environment MAM is responsible for and conducts outstanding international doctoral education in the postgraduate education subject Mathematics / Applied Mathematics at Mälardalen University.
Annually, several MAM graduate students receive a doctorate or licentiate degree in Mathematics / Applied Mathematics.

The public defense of Hrafn Holger Weishaupt's doctoral thesis in Mathematics/Applied Mathematics

Doctoral thesis and Licentiate seminars

Date: 2019-03-08

Time: 13.15 - 15.45

The public defense of Hrafn Holger Weishaupt's doctoral thesis in Mathematics/Applied Mathematics will take place at MDH Västerås, 

room Gamma, at 13.15 on March 8.

Title: Graph theory based approaches for gene prioritization in biological networks. Application to cancer gene detection in medulloblastoma

Serial number: 286

The faculty examiner is Professor Erik Bongcam-Rudloff, Swedish University of Agricultural Sciences, and the examining committee consists of Professor Christos Skiadas, Technical University of Crete; Docent Andriy Andreev, Stockholm University; Professor Dirk Repsilber, Örebro University.

Reserve; Senior Researcher George Fodor


Networks provide an intuitive and highly adaptable means to model relationships between objects. When translated to mathematical graphs, they become further amenable to a plethora of mathematical operations that allow a detailed study of the underlying relational data. Thus, it is not surprising that networks have evolved to a predominant method for analyzing such data in a vast variety of research fields. However, with increasing complexity of the studied problems, application of network modeling also becomes more challenging. Specifically, given a process to be studied, (i) which interactions are important and how can they be modeled, (ii) how can relationships be inferred from complex and potentially noisy data, and (iii) which methods should be used to test hypotheses or answer the relevant questions? This thesis explores the concept and challenges of network analysis in the context of a well-defined application area, i.e. the prediction of cancer genes from biological networks, with an application to medulloblastoma research.

Medulloblastoma represents the most common malignant brain tumor in children. Currently about 70% of treated patients survive, but they often suffer from permanent cognitive sequelae. Medulloblastoma has previously been shown to harbor at least four distinct molecular subgroups. Related studies have also greatly advanced our understanding of the genetic aberrations associated with MB subgroups. However, to translate such findings to novel and improved therapy options, further insights are required into how the dysregulated genes interact with the rest of the cellular system, how such a cross-talk can drive tumor development, and how the arising tumorigenic processes can be targeted by drugs. Establishing such understanding requires investigations that can address biological processes at a more system-wide level, a task that can be approached through the study of cellular systems as mathematical networks of molecular interactions.

This thesis discusses the identification of cancer genes from a network perspective, where specific focus is placed on one particular type of network, i.e. so called gene regulatory networks that model relationships between genes at the expression level. The thesis outlines the bridge between biological and mathematical network concepts. Specifically, the computational challenge of inferring such networks from molecular data is presented. Mathematical approaches for analyzing these networks are outlined and it is explored how such methods might be affected by network inference. Further focus is placed on dealing with the challenges of establishing a suitable gene expression dataset for network inference in MB. Finally, the thesis is concluded with an application of various network approaches in a hypothesis-driven study in MB, in which various novel candidate genes were prioritized.