Mining TCGA Data Using Boolean Implications
Author(s)
Sinha, Subarna; Tsang, Emily K.; Zeng, Haoyang; Meister, Michela; Dill, David L.
DownloadSinha-2014-Mining TCGA Data Usi.pdf (802.0Kb)
PUBLISHER_CC
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
Boolean implications (if-then rules) provide a conceptually simple, uniform and highly scalable way to find associations between pairs of random variables. In this paper, we propose to use Boolean implications to find relationships between variables of different data types (mutation, copy number alteration, DNA methylation and gene expression) from the glioblastoma (GBM) and ovarian serous cystadenoma (OV) data sets from The Cancer Genome Atlas (TCGA). We find hundreds of thousands of Boolean implications from these data sets. A direct comparison of the relationships found by Boolean implications and those found by commonly used methods for mining associations show that existing methods would miss relationships found by Boolean implications. Furthermore, many relationships exposed by Boolean implications reflect important aspects of cancer biology. Examples of our findings include cis relationships between copy number alteration, DNA methylation and expression of genes, a new hierarchy of mutations and recurrent copy number alterations, loss-of-heterozygosity of well-known tumor suppressors, and the hypermethylation phenotype associated with IDH1 mutations in GBM. The Boolean implication results used in the paper can be accessed at http://crookneck.stanford.edu/microarray/TCGANetworks/.
Date issued
2014-07Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
PLoS ONE
Publisher
Public Library of Science
Citation
Sinha, Subarna, Emily K. Tsang, Haoyang Zeng, Michela Meister, and David L. Dill. “Mining TCGA Data Using Boolean Implications.” Edited by Vladimir B. Bajic. PLoS ONE 9, no. 7 (July 23, 2014): e102119.
Version: Final published version
ISSN
1932-6203