首页> 外文期刊>Bioinformatics >EPSILON: an eQTL prioritization framework using similarity measures derived from local networks
【24h】

EPSILON: an eQTL prioritization framework using similarity measures derived from local networks

机译:EPSILON:使用从本地网络获得的相似性度量的eQTL优先级划分框架

获取原文
获取原文并翻译 | 示例
       

摘要

Motivation: When genomic data are associated with gene expression data, the resulting expression quantitative trait loci (eQTL) will likely span multiple genes. eQTL prioritization techniques can be used to select the most likely causal gene affectingthe expression of a target gene from a list of candidates. As an input, these techniques use physical interaction networks that often contain highly connected genes and unreliable or irrelevant interactions that can interfere with the prioritization process. We present EPSILON, an extendable framework for eQTL prioritization, which mitigates the effect of highly connected genes and unreliable interactions by constructing a local network before a network-based similarity measure is applied to select thetrue causal gene. Results: We tested the new method on three eQTL datasets derived from yeast data using three different association techniques. A physical interaction network was constructed, and each eQTL in each dataset was prioritized using the EPSILON approach: first, a local network was constructed using a /c-trials shortest path algorithm, followed by the calculation of a network-based similarity measure. Three similarity measures were evaluated: random walks, the Laplacian Exponential Diffusionkernel and the Regularized Commute-Time kernel. The aim was to predict knockout interactions from a yeast knockout compendium. EPSILON outperformed two reference prioritization methods, random assignment and shortest path prioritization. Next, we foundthat using a local network significantly increased prioritization performance in terms of predicted knockout pairs when compared with using exactly the same network similarity measures on the global network, with an average increase in prioritization performance of 8 percentage points (P< 10 s). Availability: The physical interaction network and the source code (Matlab/C++) of our implementation can be downloaded from http://bioinformatics.intec.ugent.be/epsilon.
机译:动机:将基因组数据与基因表达数据关联时,所得的表达定量性状基因座(eQTL)可能会跨越多个基因。 eQTL优先排序技术可用于从候选列表中选择最有可能影响目标基因表达的因果基因。作为一种输入,这些技术使用的物理交互网络通常包含高度连接的基因以及不可靠或不相关的交互,这些交互会干扰优先排序过程。我们提出了EPSILON,这是eQTL优先顺序的可扩展框架,它可以通过在基于网络的相似性度量选择真正的因果基因之前构建一个本地网络来缓解高度连接的基因和不可靠的相互作用的影响。结果:我们使用三种不同的关联技术在源自酵母数据的三个eQTL数据集上测试了该新方法。构建了一个物理交互网络,并使用EPSILON方法对每个数据集中的每个eQTL进行了优先排序:首先,使用/ c-trials最短路径算法构建了一个本地网络,然后计算了基于网络的相似性度量。评价了三种相似性度量:随机游走,拉普拉斯指数扩散核和正则通勤时间核。目的是预测酵母敲除纲要中的敲除相互作用。 EPSILON的性能优于两种参考优先级方法,即随机分配和最短路径优先级。接下来,我们发现,与在全局网络上使用完全相同的网络相似性度量相比,使用本地网络在预测的敲除对方面显着提高了优先级性能,平均优先级性能提高了8个百分点(P <10 s) 。可用性:可以从http://bioinformatics.intec.ugent.be/epsilon下载我们实现的物理交互网络和源代码(Matlab / C ++)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号