Role of non-coding RNA alterations in melanoma

Cutaneous melanoma (CM) is a potentially lethal form of skin cancer and its most important histopathologic factor for staging is Breslow thickness (BT). Its correct determination is fundamental for pathologists. A deeper understanding of the molecular processes guiding CM pathogenesis could improve diagnosis, treatment and prognosis. MicroRNAs (miRNAs) play a key role in CM biology. The firs aim was to investigate miRNA expression in reference to BT assessment. We found that the combined miRNA expression of miR-21-5p and miR-146a-5p above or below 1.5 was significantly associated with overall survival and successfully identified all superficially spreading melanoma (SSM) patients with relapsing suggesting that the combined assessment of these miRNAs expression could aid in SSM staging. Secondly, we focus on multiple primary melanoma (MPM) patients, which develop multiple primary melanomas in their lifetime, and represent a model of high-risk CM occurrence. We explored the miRNome of single CM and MPM: CM and MPM present several dysregulated miRNAs, including key miRNAs involved in epithelial-mesenchymal transition. A different miRNA profile was observed between 1st and 2nd melanoma from the same patient. MiRNA target analysis revealed a more differentiated and less invasive status of MPMs compared to CMs. This characterization of the miRNA regulatory network of MPMs highlights molecular features differentiating this subtype from CM. Recently, NGS experiments revealed the existence of miRNA variants (isomiRs) with different length and sequence. We identified a shorter 3’isoform as tenfold over-represented compared to the canonical form of miR-125a-5p. Target analysis revealed that miRNA shortening could change the pattern of target gene regulation. Finally, we study miRNA and isomiR dysregulation in benign nevi (BN) and CM and in CM and melanoma metastasis. The reported non-random dysregulation of specific isomiRs contributes to the understanding of the complex melanoma pathogenesis and serves as the basis for further functional studies.

Bayesian Analysis of Linear Inverse Problems with Applications in Economics and Finance

In my PhD thesis I propose a Bayesian nonparametric estimation method for structural econometric models where the functional parameter of interest describes the economic agent's behavior. The structural parameter is characterized as the solution of a functional equation, or by using more technical words, as the solution of an inverse problem that can be either ill-posed or well-posed. From a Bayesian point of view, the parameter of interest is a random function and the solution to the inference problem is the posterior distribution of this parameter. A regular version of the posterior distribution in functional spaces is characterized. However, the infinite dimension of the considered spaces causes a problem of non continuity of the solution and then a problem of inconsistency, from a frequentist point of view, of the posterior distribution (i.e. problem of ill-posedness). The contribution of this essay is to propose new methods to deal with this problem of ill-posedness. The first one consists in adopting a Tikhonov regularization scheme in the construction of the posterior distribution so that I end up with a new object that I call regularized posterior distribution and that I guess it is solution of the inverse problem. The second approach consists in specifying a prior distribution on the parameter of interest of the g-prior type. Then, I detect a class of models for which the prior distribution is able to correct for the ill-posedness also in infinite dimensional problems. I study asymptotic properties of these proposed solutions and I prove that, under some regularity condition satisfied by the true value of the parameter of interest, they are consistent in a "frequentist" sense. Once I have set the general theory, I apply my bayesian nonparametric methodology to different estimation problems. First, I apply this estimator to deconvolution and to hazard rate, density and regression estimation. Then, I consider the estimation of an Instrumental Regression that is useful in micro-econometrics when we have to deal with problems of endogeneity. Finally, I develop an application in finance: I get the bayesian estimator for the equilibrium asset pricing functional by using the Euler equation defined in the Lucas'(1978) tree-type models.

Application-oriented Mixed Integer Non-Linear Programming

In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world can be modeled as an MINLP problem; (iii) the challenging nature of this very general class of problems. It is well-known that MINLP problems are NP-hard because they are the generalization of MILP problems, which are NP-hard themselves. However, MINLPs are, in general, also hard to solve in practice. We address to non-convex MINLPs, i.e. having non-convex continuous relaxations: the presence of non-convexities in the model makes these problems usually even harder to solve. The aim of this Ph.D. thesis is to give a flavor of different possible approaches that one can study to attack MINLP problems with non-convexities, with a special attention to real-world problems. In Part 1 of the thesis we introduce the problem and present three special cases of general MINLPs and the most common methods used to solve them. These techniques play a fundamental role in the resolution of general MINLP problems. Then we describe algorithms addressing general MINLPs. Parts 2 and 3 contain the main contributions of the Ph.D. thesis. In particular, in Part 2 four different methods aimed at solving different classes of MINLP problems are presented. Part 3 of the thesis is devoted to real-world applications: two different problems and approaches to MINLPs are presented, namely Scheduling and Unit Commitment for Hydro-Plants and Water Network Design problems. The results show that each of these different methods has advantages and disadvantages. Thus, typically the method to be adopted to solve a real-world problem should be tailored on the characteristics, structure and size of the problem. Part 4 of the thesis consists of a brief review on tools commonly used for general MINLP problems, constituted an integral part of the development of this Ph.D. thesis (especially the use and development of open-source software). We present the main characteristics of solvers for each special case of MINLP.

Formulations and Algorithms for Routing Problems

Combinatorial Optimization is a branch of optimization that deals with the problems where the set of feasible solutions is discrete. Routing problem is a well studied branch of Combinatorial Optimization that concerns the process of deciding the best way of visiting the nodes (customers) in a network. Routing problems appear in many real world applications including: Transportation, Telephone or Electronic data Networks. During the years, many solution procedures have been introduced for the solution of different Routing problems. Some of them are based on exact approaches to solve the problems to optimality and some others are based on heuristic or metaheuristic search to find optimal or near optimal solutions. There is also a less studied method, which combines both heuristic and exact approaches to face different problems including those in the Combinatorial Optimization area. The aim of this dissertation is to develop some solution procedures based on the combination of heuristic and Integer Linear Programming (ILP) techniques for some important problems in Routing Optimization. In this approach, given an initial feasible solution to be possibly improved, the method follows a destruct-and-repair paradigm, where the given solution is randomly destroyed (i.e., customers are removed in a random way) and repaired by solving an ILP model, in an attempt to find a new improved solution.

Identification and characterization of the sRNA network in Neisseria meningitidis

Bacterial small regulatory RNAs (sRNAs) are posttranscriptional regulators involved in stress responses. These short non-coding transcripts are synthesised in response to a signal, and control gene expression of their regulons by modulating the translation or stability of the target mRNAs, often in concert with the RNA chaperone Hfq. Characterization of a Hfq knock out mutant in Neisseria meningitidis revealed that it has a pleiotropic phenotype, suggesting a major role for Hfq in adaptation to stresses and virulence and the presence of Hfq-dependent sRNA activity. Global gene expression analysis of regulated transcripts in the Hfq mutant revealed the presence of a regulated sRNA, incorrectly annotated as an open reading frame, which we renamed AniS. The synthesis of this novel sRNA is anaerobically induced through activation of its promoter by the FNR global regulator and through global gene expression analyses we identified at least two predicted mRNA targets of AniS. We also performed a detailed molecular analysis of the action of the sRNA NrrF,. We demonstrated that NrrF regulates succinate dehydrogenase by forming a duplex with a region of complementarity within the sdhDA region of the succinate dehydrogenase transcript, and Hfq enhances the binding of this sRNA to the identified target in the sdhCDAB mRNA; this is likely to result in rapid turnover of the transcript in vivo. In addition, in order to globally investigate other possible sRNAs of N. meningitdis we Deep-sequenced the transcriptome of this bacterium under both standard in vitro and iron-depleted conditions. This analysis revealed genes that were actively transcribed under the two conditions. We focused our attention on the transcribed non-coding regions of the genome and, along with 5’ and 3’ untranslated regions, 19 novel candidate sRNAs were identified. Further studies will be focused on the identification of the regulatory networks of these sRNAs, and their targets.

Decomposition Methods and Network Design Problems

Decomposition based approaches are recalled from primal and dual point of view. The possibility of building partially disaggregated reduced master problems is investigated. This extends the idea of aggregated-versus-disaggregated formulation to a gradual choice of alternative level of aggregation. Partial aggregation is applied to the linear multicommodity minimum cost flow problem. The possibility of having only partially aggregated bundles opens a wide range of alternatives with different trade-offs between the number of iterations and the required computation for solving it. This trade-off is explored for several sets of instances and the results are compared with the ones obtained by directly solving the natural node-arc formulation. An iterative solution process to the route assignment problem is proposed, based on the well-known Frank Wolfe algorithm. In order to provide a first feasible solution to the Frank Wolfe algorithm, a linear multicommodity min-cost flow problem is solved to optimality by using the decomposition techniques mentioned above. Solutions of this problem are useful for network orientation and design, especially in relation with public transportation systems as the Personal Rapid Transit. A single-commodity robust network design problem is addressed. In this, an undirected graph with edge costs is given together with a discrete set of balance matrices, representing different supply/demand scenarios. The goal is to determine the minimum cost installation of capacities on the edges such that the flow exchange is feasible for every scenario. A set of new instances that are computationally hard for the natural flow formulation are solved by means of a new heuristic algorithm. Finally, an efficient decomposition-based heuristic approach for a large scale stochastic unit commitment problem is presented. The addressed real-world stochastic problem employs at its core a deterministic unit commitment planning model developed by the California Independent System Operator (ISO).

Robotic Sensing and Manipulation of Deformable Linear Objects with Learning-based methods

Nowadays robotic applications are widespread and most of the manipulation tasks are efficiently solved. However, Deformable-Objects (DOs) still represent a huge limitation for robots. The main difficulty in DOs manipulation is dealing with the shape and dynamics uncertainties, which prevents the use of model-based approaches (since they are excessively computationally complex) and makes sensory data difficult to interpret. This thesis reports the research activities aimed to address some applications in robotic manipulation and sensing of Deformable-Linear-Objects (DLOs), with particular focus to electric wires. In all the works, a significant effort was made in the study of an effective strategy for analyzing sensory signals with various machine learning algorithms. In the former part of the document, the main focus concerns the wire terminals, i.e. detection, grasping, and insertion. First, a pipeline that integrates vision and tactile sensing is developed, then further improvements are proposed for each module. A novel procedure is proposed to gather and label massive amounts of training images for object detection with minimal human intervention. Together with this strategy, we extend a generic object detector based on Convolutional-Neural-Networks for orientation prediction. The insertion task is also extended by developing a closed-loop control capable to guide the insertion of a longer and curved segment of wire through a hole, where the contact forces are estimated by means of a Recurrent-Neural-Network. In the latter part of the thesis, the interest shifts to the DLO shape. Robotic reshaping of a DLO is addressed by means of a sequence of pick-and-place primitives, while a decision making process driven by visual data learns the optimal grasping locations exploiting Deep Q-learning and finds the best releasing point. The success of the solution leverages on a reliable interpretation of the DLO shape. For this reason, further developments are made on the visual segmentation.

Applications of network-based approaches in drug research

Recent research trends in computer-aided drug design have shown an increasing interest towards the implementation of advanced approaches able to deal with large amount of data. This demand arose from the awareness of the complexity of biological systems and from the availability of data provided by high-throughput technologies. As a consequence, drug research has embraced this paradigm shift exploiting approaches such as that based on networks. Indeed, the process of drug discovery can benefit from the implementation of network-based methods at different steps from target identification to drug repurposing. From this broad range of opportunities, this thesis is focused on three main topics: (i) chemical space networks (CSNs), which are designed to represent and characterize bioactive compound data sets; (ii) drug-target interactions (DTIs) prediction through a network-based algorithm that predicts missing links; (iii) COVID-19 drug research which was explored implementing COVIDrugNet, a network-based tool for COVID-19 related drugs. The main highlight emerged from this thesis is that network-based approaches can be considered useful methodologies to tackle different issues in drug research. In detail, CSNs are valuable coordinate-free, graphically accessible representations of structure-activity relationships of bioactive compounds data sets especially for medium-large libraries of molecules. DTIs prediction through the random walk with restart algorithm on heterogeneous networks can be a helpful method for target identification. COVIDrugNet is an example of the usefulness of network-based approaches for studying drugs related to a specific condition, i.e., COVID-19, and the same ‘systems-based’ approaches can be used for other diseases. To conclude, network-based tools are proving to be suitable in many applications in drug research and provide the opportunity to model and analyze diverse drug-related data sets, even large ones, also integrating different multi-domain information.

Characterisation of RNase Y in H. pylori: a non-essential enzyme involved in the processing of cag-PAI non coding RNA 1 (CncR1) sRNA

The importance of Helicobacter pylori as a human pathogen is underlined by the plethora of diseases it is responsible for. The capacity of H. pylori to adapt to the restricted host-associated environment andto evade the host immune response largely depends on a streamlined signalling network. The peculiar H. pylori small genome size combined with its paucity of transcriptional regulators highlights the relevance of post-transcriptional regulatory mechanisms as small non-coding RNAs (sRNAs). However, among the 8 RNases represented in H. pylori genome, a regulator guiding sRNAs metabolism is still not well studied. We investigated for the first time the physiological role in H. pylori G27 strain of the RNase Y enzyme. In the first line of research we provide a comprehensive characterization of the RNase Y activity by analysing its genomic organization and the factors that orchestrate its expression. Then, based on bioinformatic prediction models, we depict the most relevant determinants of RNase Y function, demonstrating a correlation of both structure and domain organization with orthologues represented in Gram-positive bacteria. To unveil the post-transcriptional regulatory effect exerted by the RNase Y, we compared the transcriptome of an RNase Y knock-out mutant to the parental wild type strain by RNA-seq approach. In the second line of research we characterized the activity of this single strand specific endoribonuclease on cag-PAI non coding RNA 1 (CncR1) sRNA. We found that deletion or inactivation of RNase Y led to the accumulation of a 3’-extended CncR1 (CncR1-L) transcript over time. Moreover, beneath its increased half-life, CncR1-L resembled a CncR1 inactive phenotype. Finally, we focused on the characterization of the in vivo interactome of CncR1. We set up a preliminary MS2-affinity purification coupled with RNA-sequencing (MAPS) approach and we evaluated the enrichment of specific targets, demonstrating the suitability of the technique in the H. pylori G27 strain.

On the effect of confounding in linear regression models: an approach based on the theory of quadratic forms

The main topic of this thesis is confounding in linear regression models. It arises when a relationship between an observed process, the covariate, and an outcome process, the response, is influenced by an unmeasured process, the confounder, associated with both. Consequently, the estimators for the regression coefficients of the measured covariates might be severely biased, less efficient and characterized by misleading interpretations. Confounding is an issue when the primary target of the work is the estimation of the regression parameters. The central point of the dissertation is the evaluation of the sampling properties of parameter estimators. This work aims to extend the spatial confounding framework to general structured settings and to understand the behaviour of confounding as a function of the data generating process structure parameters in several scenarios focusing on the joint covariate-confounder structure. In line with the spatial statistics literature, our purpose is to quantify the sampling properties of the regression coefficient estimators and, in turn, to identify the most prominent quantities depending on the generative mechanism impacting confounding. Once the sampling properties of the estimator conditionally on the covariate process are derived as ratios of dependent quadratic forms in Gaussian random variables, we provide an analytic expression of the marginal sampling properties of the estimator using Carlson’s R function. Additionally, we propose a representative quantity for the magnitude of confounding as a proxy of the bias, its first-order Laplace approximation. To conclude, we work under several frameworks considering spatial and temporal data with specific assumptions regarding the covariance and cross-covariance functions used to generate the processes involved. This study allows us to claim that the variability of the confounder-covariate interaction and of the covariate plays the most relevant role in determining the principal marker of the magnitude of confounding.

Seemingly unrelated linear regression for contaminated data based on Gaussian mixtures

In this thesis, new classes of models for multivariate linear regression defined by finite mixtures of seemingly unrelated contaminated normal regression models and seemingly unrelated contaminated normal cluster-weighted models are illustrated. The main difference between such families is that the covariates are treated as fixed in the former class of models and as random in the latter. Thus, in cluster-weighted models the assignment of the data points to the unknown groups of observations depends also by the covariates. These classes provide an extension to mixture-based regression analysis for modelling multivariate and correlated responses in the presence of mild outliers that allows to specify a different vector of regressors for the prediction of each response. Expectation-conditional maximisation algorithms for the calculation of the maximum likelihood estimate of the model parameters have been derived. As the number of free parameters incresases quadratically with the number of responses and the covariates, analyses based on the proposed models can become unfeasible in practical applications. These problems have been overcome by introducing constraints on the elements of the covariance matrices according to an approach based on the eigen-decomposition of the covariance matrices. The performances of the new models have been studied by simulations and using real datasets in comparison with other models. In order to gain additional flexibility, mixtures of seemingly unrelated contaminated normal regressions models have also been specified so as to allow mixing proportions to be expressed as functions of concomitant covariates. An illustration of the new models with concomitant variables and a study on housing tension in the municipalities of the Emilia-Romagna region based on different types of multivariate linear regression models have been performed.

From images to signs: Cretan Hieroglyphic and Linear A in context

This dissertation adopts a multidisciplinary approach to investigate graphical and formal features of Cretan Hieroglyphic and Linear A. Drawing on theories which understand inscribed artefacts as an interplay of materials, iconography, and texts, I combine archaeological and philological considerations with statistical and experimental observations. The work is formulated on three key-questions. The first deals with the origins of Cretan Hieroglyphic. After providing a fresh view on Prepalatial seals chronology, I identify a number of forerunners of Hieroglyphic signs in iconographic motifs attested among the Prepalatial glyptic and material culture. I further identified a specific style-group, i.e., the ‘Border and Leaf Complex’, as the decisive step towards the emergence of the Hieroglyphic graphic repertoire. The second deals with the interweaving of formal, iconographical, and epigraphic features of Hieroglyphic seals with the sequences they bear and the contexts of their usage. By means of two Correspondence Analyses, I showed that the iconography on seals in some materials and shapes is closer to Cretan Hieroglyphics, than that on the other ones. Through two Social Network Analyses, I showed that Hieroglyphic impressions, especially at Knossos, follow a precise sealing pattern due to their shapes and sequences. Furthermore, prisms with a high number of inscribed faces adhere to formal features of jasper ones. Finally, through experimental engravings, I showed differences in cutting rates among materials, as well as the efficiency of abrasives and tools unearthed within the Quartier Mu. The third question concerns overlaps in chronology, findspots and signaries between Cretan Hieroglyphic and Linear A. I discussed all possible earliest instances of both scripts and argued for some items datable to the MM I-IIA period. I further provide an insight into the Hieroglyphic-Linear A dubitanda and criteria for their interpretation. Finally, I suggest four different patterns in the creation and diversification of the two signaries.

Data driven regularization models of non-linear ill-posed inverse problems in imaging

Imaging technologies are widely used in application fields such as natural sciences, engineering, medicine, and life sciences. A broad class of imaging problems reduces to solve ill-posed inverse problems (IPs). Traditional strategies to solve these ill-posed IPs rely on variational regularization methods, which are based on minimization of suitable energies, and make use of knowledge about the image formation model (forward operator) and prior knowledge on the solution, but lack in incorporating knowledge directly from data. On the other hand, the more recent learned approaches can easily learn the intricate statistics of images depending on a large set of data, but do not have a systematic method for incorporating prior knowledge about the image formation model. The main purpose of this thesis is to discuss data-driven image reconstruction methods which combine the benefits of these two different reconstruction strategies for the solution of highly nonlinear ill-posed inverse problems. Mathematical formulation and numerical approaches for image IPs, including linear as well as strongly nonlinear problems are described. More specifically we address the Electrical impedance Tomography (EIT) reconstruction problem by unrolling the regularized Gauss-Newton method and integrating the regularization learned by a data-adaptive neural network. Furthermore we investigate the solution of non-linear ill-posed IPs introducing a deep-PnP framework that integrates the graph convolutional denoiser into the proximal Gauss-Newton method with a practical application to the EIT, a recently introduced promising imaging technique. Efficient algorithms are then applied to the solution of the limited electrods problem in EIT, combining compressive sensing techniques and deep learning strategies. Finally, a transformer-based neural network architecture is adapted to restore the noisy solution of the Computed Tomography problem recovered using the filtered back-projection method.