Biomolecular studies in Alzheimer’s Disease models: investigations in vitro and in vivo

The Alzheimer’s disease (AD), the most prevalent form of age-related dementia, is a multifactorial and heterogeneous neurodegenerative disease. The molecular mechanisms underlying the pathogenesis of AD are yet largely unknown. However, the etiopathogenesis of AD likely resides in the interaction between genetic and environmental risk factors. Among the different factors that contribute to the pathogenesis of AD, amyloid-beta peptides and the genetic risk factor apoE4 are prominent on the basis of genetic evidence and experimental data. ApoE4 transgenic mice have deficits in spatial learning and memory associated with inflammation and brain atrophy. Evidences suggest that apoE4 is implicated in amyloid-beta accumulation, imbalance of cellular antioxidant system and in apoptotic phenomena. The mechanisms by which apoE4 interacts with other AD risk factors leading to an increased susceptibility to the dementia are still unknown. The aim of this research was to provide new insights into molecular mechanisms of AD neurodegeneration, investigating the effect of amyloid-beta peptides and apoE4 genotype on the modulation of genes and proteins differently involved in cellular processes related to aging and oxidative balance such as PIN1, SIRT1, PSEN1, BDNF, TRX1 and GRX1. In particular, we used human neuroblastoma cells exposed to amyloid-beta or apoE3 and apoE4 proteins at different time-points, and selected brain regions of human apoE3 and apoE4 targeted replacement mice, as in vitro and in vivo models, respectively. All genes and proteins studied in the present investigation are modulated by amyloid-beta and apoE4 in different ways, suggesting their involvement in the neurodegenerative mechanisms underlying the AD. Finally, these proteins might represent novel potential diagnostic and therapeutic targets in AD.

Deep learning and spatial transcriptomics to investigate thyroid tumors

There are many diseases that affect the thyroid gland, and among them are carcinoma. Thyroid cancer is the most common endocrine neoplasm and the second most frequent cancer in the 0-49 age group. This thesis deals with two studies I conducted during my PhD. The first concerns the development of a Deep Learning model to be able to assist the pathologist in screening of thyroid cytology smears. This tool created in collaboration with Prof. Diciotti, affiliated with the DEI-UNIBO "Guglielmo Marconi" Department of Electrical Energy and Information Engineering, has an important clinical implication in that it allows patients to be stratified between those who should undergo surgery and those who should not. The second concerns the application of spatial transcriptomics on well-differentiated thyroid carcinomas to better understand their invasion mechanisms and thus to better comprehend which genes may be involved in the proliferation of these tumors. This project specifically was made possible through a fruitful collaboration with the Gustave Roussy Institute in Paris. Studying thyroid carcinoma deeply is essential to improve patient care, increase survival rates, and enhance the overall understanding of this prevalent cancer. It can lead to more effective prevention, early detection, and treatment strategies that benefit both patients and the healthcare system.

The three-dimensional single-bin-size bin packing problem: combining metaheuristic and machine learning approaches

The Three-Dimensional Single-Bin-Size Bin Packing Problem is one of the most studied problem in the Cutting & Packing category. From a strictly mathematical point of view, it consists of packing a finite set of strongly heterogeneous “small” boxes, called items, into a finite set of identical “large” rectangles, called bins, minimizing the unused volume and requiring that the items are packed without overlapping. The great interest is mainly due to the number of real-world applications in which it arises, such as pallet and container loading, cutting objects out of a piece of material and packaging design. Depending on these real-world applications, more objective functions and more practical constraints could be needed. After a brief discussion about the real-world applications of the problem and a exhaustive literature review, the design of a two-stage algorithm to solve the aforementioned problem is presented. The algorithm must be able to provide the spatial coordinates of the placed boxes vertices and also the optimal boxes input sequence, while guaranteeing geometric, stability, fragility constraints and a reduced computational time. Due to NP-hard complexity of this type of combinatorial problems, a fusion of metaheuristic and machine learning techniques is adopted. In particular, a hybrid genetic algorithm coupled with a feedforward neural network is used. In the first stage, a rich dataset is created starting from a set of real input instances provided by an industrial company and the feedforward neural network is trained on it. After its training, given a new input instance, the hybrid genetic algorithm is able to run using the neural network output as input parameter vector, providing as output the optimal solution. The effectiveness of the proposed works is confirmed via several experimental tests.

Statistical learning of random probability measures

The study of random probability measures is a lively research topic that has attracted interest from different fields in recent years. In this thesis, we consider random probability measures in the context of Bayesian nonparametrics, where the law of a random probability measure is used as prior distribution, and in the context of distributional data analysis, where the goal is to perform inference given avsample from the law of a random probability measure. The contributions contained in this thesis can be subdivided according to three different topics: (i) the use of almost surely discrete repulsive random measures (i.e., whose support points are well separated) for Bayesian model-based clustering, (ii) the proposal of new laws for collections of random probability measures for Bayesian density estimation of partially exchangeable data subdivided into different groups, and (iii) the study of principal component analysis and regression models for probability distributions seen as elements of the 2-Wasserstein space. Specifically, for point (i) above we propose an efficient Markov chain Monte Carlo algorithm for posterior inference, which sidesteps the need of split-merge reversible jump moves typically associated with poor performance, we propose a model for clustering high-dimensional data by introducing a novel class of anisotropic determinantal point processes, and study the distributional properties of the repulsive measures, shedding light on important theoretical results which enable more principled prior elicitation and more efficient posterior simulation algorithms. For point (ii) above, we consider several models suitable for clustering homogeneous populations, inducing spatial dependence across groups of data, extracting the characteristic traits common to all the data-groups, and propose a novel vector autoregressive model to study of growth curves of Singaporean kids. Finally, for point (iii), we propose a novel class of projected statistical methods for distributional data analysis for measures on the real line and on the unit-circle.