| Literature DB >> 25861215 |
Min Jin Ha1, Veerabhadran Baladandayuthapani1, Kim-Anh Do1.
Abstract
Identification of molecular-based signatures is one of the critical steps toward finding therapeutic targets in cancer. In this paper, we propose methods to discover prognostic gene signatures under a causal structure learning framework across the whole genome. The causal structures are represented by directed acyclic graphs (DAGs), wherein we construct gene-specific network modules that constitute a gene and its corresponding regulators. The modules are then subsequently used to correlate with survival times, thus, allowing for a network-oriented approach to gene selection to adjust for potential confounders, as opposed to univariate (gene-by-gene) approaches. Our methods are motivated by and applied to a clear cell renal cell carcinoma (ccRCC) study from The Cancer Genome Atlas (TCGA) where we find several prognostic genes associated with cancer progression - some of which are novel while others confirm existing findings.Entities:
Keywords: Gaussian graphical models; Markov equivalence class; Peter and Clark (PC) algorithm; kidney cancer; network; survival time
Year: 2015 PMID: 25861215 PMCID: PMC4362630 DOI: 10.4137/CIN.S14873
Source DB: PubMed Journal: Cancer Inform ISSN: 1176-9351