癌症进展模型推理的高效搜索方案的并行实现
Parallel Implementation of Efficient Search Schemes for the Inference of Cancer Progression Models
摘要:
癌症的出现和发展是涉及一组特定基因的基因组突变随时间积累的结果,这为癌症克隆提供了功能选择优势。在这项工作中,我们通过概率图形模型,即,贝叶斯网络(BN)。我们研究如何执行的任务,学习这样的BN的结构,根据实验证据,采用全局优化元算法。特别是,在这项工作中,我们依靠遗传算法,并大大减少执行时间的推断-这也可能涉及多次重复收集统计上显着的评估数据-我们分布使用多线程和多节点架构的计算。结果表明,我们的方法具有良好的准确性和特异性;我们还证明了其可行性,这要归功于相对于传统的顺序实现,整体执行时间减少了84倍。
英文摘要:
The emergence and development of cancer is a consequence of the accumulation over time of genomic mutations involving a specific set of genes, which provides the cancer clones with a functional selective advantage. In this work, we model the order of accumulation of such mutations during the progression, which eventually leads to the disease, by means of probabilistic graphic models, i.e., Bayesian Networks (BNs). We investigate how to perform the task of learning the structure of such BNs, according to experimental evidence, adopting a global optimization meta-heuristics. In particular, in this work we rely on Genetic Algorithms, and to strongly reduce the execution time of the inference -- which can also involve multiple repetitions to collect statistically significant assessments of the data -- we distribute the calculations using both multi-threading and a multi-node architecture. The results show that our approach is characterized by good accuracy and specificity; we also demonstrate its feasibility, thanks to a 84x reduction of the overall execution time with respect to a traditional sequential implementation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。