SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Gustafsson Mika 1977 ) srt2:(2010-2014)"

Search: WFRF:(Gustafsson Mika 1977 ) > (2010-2014)

  • Result 1-3 of 3
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Bruhn, Sören, 1976-, et al. (author)
  • Combining gene expression microarray- and cluster analysis with sequence-based predictions to identify regulators of IL-13 in allergy
  • 2012
  • In: Cytokine. - : Elsevier. - 1043-4666 .- 1096-0023. ; 60:3, s. 736-740
  • Journal article (peer-reviewed)abstract
    • The Th2 cytokine IL-13 plays a key role in allergy, by regulating IgE, airway hyper secretion, eosinophils and mast cells. In this study, we aimed to identify novel transcription factors (TFs) that potentially regulated IL-13. We analyzed Th2 polarized naïve T cells from four different blood donors with gene expression microarrays to find clusters of genes that were correlated or anti-correlated with IL13. These clusters were further filtered, by selecting genes that were functionally related. In these clusters, we identified three transcription factors (TFs) that were predicted to regulate the expression of IL13, namely CEBPB, E2F6 and AHR. siRNA mediated knockdowns of these TFs in naïve polarized T cells showed significant increases of IL13, following knockdown of CEBPB and E2F6, but not AHR. This suggested an inhibitory role of CEBPB and E2F6 in the regulation of IL13 and allergy. This was supported by analysis of E2F6, but not CEBPB, in allergen-challenged CD4+ T cells from six allergic patients and six healthy controls, which showed decreased expression of E2F6 in patients. In summary, our findings indicate an inhibitory role of E2F6 in the regulation of IL-13 and allergy. The analytical approach may be generally applicable to elucidate the complex regulatory patterns in Th2 cell polarization and allergy.
  •  
2.
  • Gustafsson, Mika, 1977-, et al. (author)
  • Gene Expression Prediction by Soft Integration and the Elastic Net : Best Performance of the DREAM3 Gene Expression Challenge
  • 2010
  • In: PLoS ONE. - : Public Library of Science (PLoS). - 1932-6203. ; 5:2, s. e9134-
  • Journal article (peer-reviewed)abstract
    • Background: To predict gene expressions is an important endeavour within computational systems biology. It can both be a way to explore how drugs affect the system, as well as providing a framework for finding which genes are interrelated in a certain process. A practical problem, however, is how to assess and discriminate among the various algorithms which have been developed for this purpose. Therefore, the DREAM project invited the year 2008 to a challenge for predicting gene expression values, and here we present the algorithm with best performance.Methodology/Principal Findings: We develop an algorithm by exploring various regression schemes with different model selection procedures. It turns out that the most effective scheme is based on least squares, with a penalty term of a recently developed form called the “elastic net”. Key components in the algorithm are the integration of expression data from other experimental conditions than those presented for the challenge and the utilization of transcription factor binding data for guiding the inference process towards known interactions. Of importance is also a cross-validation procedure where each form of external data is used only to the extent it increases the expected performance.Conclusions/Significance: Our algorithm proves both the possibility to extract information from large-scale expression data concerning prediction of gene levels, as well as the benefits of integrating different data sources for improving the inference. We believe the former is an important message to those still hesitating on the possibilities for computational approaches, while the latter is part of an important way forward for the future development of the field of computational systems biology.
  •  
3.
  • Gustafsson, Mika, 1977- (author)
  • Gene networks from high-throughput data : Reverse engineering and analysis
  • 2010
  • Doctoral thesis (other academic/artistic)abstract
    • Experimental innovations starting in the 1990’s leading to the advent of high-throughput experiments in cellular biology have made it possible to measure thousands of genes simultaneously at a modest cost. This enables the discovery of new unexpected relationships between genes in addition to the possibility of falsify existing. To benefit as much as possible from these experiments the new inter disciplinary research field of systems biology have materialized. Systems biology goes beyond the conventional reductionist approach and aims at learning the whole system under the assumption that the system is greater than the sum of its parts. One emerging enterprise in systems biology is to use the high-throughput data to reverse engineer the web of gene regulatory interactions governing the cellular dynamics. This relatively new endeavor goes further than clustering genes with similar expression patterns and requires the separation of cause of gene expression from the effect. Despite the rapid data increase we then face the problem of having too few experiments to determine which regulations are active as the number of putative interactions has increased dramatic as the number of units in the system has increased. One possibility to overcome this problem is to impose more biologically motivated constraints. However, what is a biological fact or not is often not obvious and may be condition dependent. Moreover, investigations have suggested several statistical facts about gene regulatory networks, which motivate the development of new reverse engineering algorithms, relying on different model assumptions. As a result numerous new reverse engineering algorithms for gene regulatory networks has been proposed. As a consequent, there has grown an interest in the community to assess the performance of different attempts in fair trials on “real” biological problems. This resulted in the annually held DREAM conference which contains computational challenges that can be solved by the prosing researchers directly, and are evaluated by the chairs of the conference after the submission deadline.This thesis contains the evolution of regularization schemes to reverse engineer gene networks from high-throughput data within the framework of ordinary differential equations. Furthermore, to understand gene networks a substantial part of it also concerns statistical analysis of gene networks. First, we reverse engineer a genome-wide regulatory network based solely on microarray data utilizing an extremely simple strategy assuming sparseness (LASSO). To validate and analyze this network we also develop some statistical tools. Then we present a refinement of the initial strategy which is the algorithm for which we achieved best performer at the DREAM2 conference. This strategy is further refined into a reverse engineering scheme which also can include external high-throughput data, which we confirm to be of relevance as we achieved best performer in the DREAM3 conference as well. Finally, the tools we developed to analyze stability and flexibility in linearized ordinary differential equations representing gene regulatory networks is further discussed.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-3 of 3

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view