Concurrency Optimization for Integrative Network Analysis
| dc.contributor.author | Barnes, Robert Otto II | en |
| dc.contributor.committeechair | Xuan, Jianhua | en |
| dc.contributor.committeemember | Kriz, Ronald D. | en |
| dc.contributor.committeemember | Wang, Yue J. | en |
| dc.contributor.department | Electrical and Computer Engineering | en |
| dc.date.accessioned | 2013-06-13T08:00:41Z | en |
| dc.date.available | 2013-06-13T08:00:41Z | en |
| dc.date.issued | 2013-06-12 | en |
| dc.description.abstract | Virginia Tech\'s Computational Bioinformatics and Bio-imaging Laboratory (CBIL) is exploring integrative network analysis techniques to identify subnetworks or genetic pathways that contribute to various cancers. Chen et. al. developed a bagging Markov random field (BMRF)-based approach which examines gene expression data with prior biological information to reliably identify significant genes and proteins. Using random resampling with replacement (bootstrapping or bagging) is essential to confident results but is computationally demanding as multiple iterations of the network identification (by simulated annealing) is required. The MATLAB implementation is computationally demanding, employs limited concurrency, and thus time prohibitive. Using strong software development discipline we optimize BMRF using algorithmic, compiler, and concurrency techniques (including Nvidia GPUs) to alleviate the wall clock time needed for analysis of large-scale genomic data. Particularly, we decompose the BMRF algorithm into functional blocks, implement the algorithm in C/C++ and further explore the C/C++ implementation with concurrency optimization. Experiments are conducted with simulation and real data to demonstrate that a significant speedup of BMRF can be achieved by exploiting concurrency opportunities. We believe that the experience gained by this research shall help pave the way for us to develop computationally efficient algorithms leveraging concurrency, enabling researchers to efficiently analyze larger-scale data sets essential for furthering cancer research. | en |
| dc.description.degree | Master of Science | en |
| dc.format.medium | ETD | en |
| dc.identifier.other | vt_gsexam:564 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/23220 | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | BMRF | en |
| dc.subject | simulated annealing | en |
| dc.subject | subnetwork identification | en |
| dc.subject | concurrency | en |
| dc.subject | parallelism | en |
| dc.title | Concurrency Optimization for Integrative Network Analysis | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | Computer Engineering | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | masters | en |
| thesis.degree.name | Master of Science | en |