Reconstructing targetable pathways in lung cancer by integrating diverse omics data.

Nat Commun

1] Michigan Center for Translational Pathology, University of Michigan, Ann Arbor, Michigan 8109, USA [2] Department of Pathology, University of Michigan, Ann Arbor, Michigan 48109, USA [3] Department of Computational Medicine and Bioinformatics, University of Michigan, Ann Arbor, Michigan 48109, USA.

Published: May 2014

Global 'multi-omics' profiling of cancer cells harbours the potential for characterizing the signalling networks associated with specific oncogenes. Here we profile the transcriptome, proteome and phosphoproteome in a panel of non-small cell lung cancer (NSCLC) cell lines in order to reconstruct targetable networks associated with KRAS dependency. We develop a two-step bioinformatics strategy addressing the challenge of integrating these disparate data sets. We first define an 'abundance-score' combining transcript, protein and phospho-protein abundances to nominate differentially abundant proteins and then use the Prize Collecting Steiner Tree algorithm to identify functional sub-networks. We identify three modules centred on KRAS and MET, LCK and PAK1 and β-Catenin. We validate activation of these proteins in KRAS-dependent (KRAS-Dep) cells and perform functional studies defining LCK as a critical gene for cell proliferation in KRAS-Dep but not KRAS-independent NSCLCs. These results suggest that LCK is a potential druggable target protein in KRAS-Dep lung cancers.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4107456PMC
http://dx.doi.org/10.1038/ncomms3617DOI Listing

Publication Analysis

Top Keywords

lung cancer
8
networks associated
8
reconstructing targetable
4
targetable pathways
4
pathways lung
4
cancer integrating
4
integrating diverse
4
diverse omics
4
omics data
4
data global
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!