TY - JOUR
T1 - Modular network construction using eQTL data
T2 - An analysis of computational costs and benefits
AU - Ho, Yen Yi
AU - Cope, Leslie M.
AU - Parmigiani, Giovanni
PY - 2014
Y1 - 2014
N2 - Background: In this paper, we consider analytic methods for the integrated analysis of genomic DNA variation and mRNA expression (also named as eQTL data), to discover genetic networks that are associated with a complex trait of interest. Our focus is the systematic evaluation of the trade-off between network size and network search efficiency in the construction of these networks. Results: We developed a modular approach to network construction, building from smaller networks to larger ones, thereby reducing the search space while including more variables in the analysis. The goal is achieving a lower computational cost while maintaining high confidence in the resulting networks. As demonstrated in our simulation results, networks built in this way have low node/edge false discovery rate (FDR) and high edge sensitivity comparing to greedy search. We further demonstrate our method in a data set of cellular responses to two chemotherapeutic agents: docetaxel and 5-fluorouracil (5-FU), and identify biologically plausible networks that might describe resistances to these drugs. Conclusion: In this study, we suggest that guided comprehensive searches for parsimonious networks should be considered as an alternative to greedy network searches.
AB - Background: In this paper, we consider analytic methods for the integrated analysis of genomic DNA variation and mRNA expression (also named as eQTL data), to discover genetic networks that are associated with a complex trait of interest. Our focus is the systematic evaluation of the trade-off between network size and network search efficiency in the construction of these networks. Results: We developed a modular approach to network construction, building from smaller networks to larger ones, thereby reducing the search space while including more variables in the analysis. The goal is achieving a lower computational cost while maintaining high confidence in the resulting networks. As demonstrated in our simulation results, networks built in this way have low node/edge false discovery rate (FDR) and high edge sensitivity comparing to greedy search. We further demonstrate our method in a data set of cellular responses to two chemotherapeutic agents: docetaxel and 5-fluorouracil (5-FU), and identify biologically plausible networks that might describe resistances to these drugs. Conclusion: In this study, we suggest that guided comprehensive searches for parsimonious networks should be considered as an alternative to greedy network searches.
KW - Bayesian networks
KW - Chemotherapy resistance
KW - EQTL
KW - Network variable selection
KW - Search algorithm
UR - http://www.scopus.com/inward/record.url?scp=84897676013&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84897676013&partnerID=8YFLogxK
U2 - 10.3389/fgene.2014.00040
DO - 10.3389/fgene.2014.00040
M3 - Article
C2 - 24616734
AN - SCOPUS:84897676013
SN - 1664-8021
VL - 5
JO - Frontiers in Genetics
JF - Frontiers in Genetics
IS - FEB
M1 - Article 40
ER -