arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.4824q-bio.MN
收藏

全球网络联盟的公平评估

Fair Evaluation of Global Network Aligners

Joseph Crawford, Yihan Sun, Tijana Milenković

摘要:

生物网络比对识别不同物种网络之间拓扑和功能保守的区域。它包含两个算法步骤:节点成本函数(NCF),用于测量不同网络中节点之间的相似性;以及对齐策略(AS),用于使用这些相似性快速识别高分对齐。不同的方法使用不同的NCF和不同的AS。因此,目前尚不清楚一种方法的优越性是否来自其NCF、AS或两者。我们已经在MI-GRAAL和IsoRankn上证明,将一种方法的NCF和另一种方法的AS相结合可以产生一种新的更好的方法。在这里,我们评估MI-GRAAL对较新的GHOST可能进一步提高比对质量。此外,我们还探讨了迄今为止尚未系统地提出的几个重要问题。首先,我们问NCF中有多少节点相似性信息应该来自序列数据,而不是拓扑数据。现有的方法或多或少地任意地确定这一点,这可能影响所得到的对齐。其次,当拓扑结构用于NCF时,我们会问比较节点的邻域大小应该有多大。现有的方法假设较大的邻域尺寸是更好的。我们发现,MI-GRAAL的NCF优于GHOST的NCF,而方法的AS的性能是依赖于数据的。因此,MI-GRAAL的NCF和GHOST的AS的组合可能是某些数据的新的优越方法。此外,在NCF中使用多少序列信息并不影响比对质量,而拓扑信息的包含是至关重要的。最后,更大的邻域大小是首选的,但通常情况下,它是第二大的大小是优越的,使用此大小将降低计算复杂性。总之,我们的研究结果给出了几个一般性的建议,一个公平的评估网络对齐方法。

英文摘要:

Biological network alignment identifies topologically and functionally conserved regions between networks of different species. It encompasses two algorithmic steps: node cost function (NCF), which measures similarities between nodes in different networks, and alignment strategy (AS), which uses these similarities to rapidly identify high-scoring alignments. Different methods use both different NCFs and different ASs. Thus, it is unclear whether the superiority of a method comes from its NCF, its AS, or both. We already showed on MI-GRAAL and IsoRankN that combining NCF of one method and AS of another method can lead to a new superior method. Here, we evaluate MI-GRAAL against newer GHOST to potentially further improve alignment quality. Also, we approach several important questions that have not been asked systematically thus far. First, we ask how much of the node similarity information in NCF should come from sequence data compared to topology data. Existing methods determine this more-less arbitrarily, which could affect the resulting alignment(s). Second, when topology is used in NCF, we ask how large the size of the neighborhoods of the compared nodes should be. Existing methods assume that larger neighborhood sizes are better. We find that MI-GRAAL's NCF is superior to GHOST's NCF, while the performance of the methods' ASs is data-dependent. Thus, the combination of MI-GRAAL's NCF and GHOST's AS could be a new superior method for certain data. Also, which amount of sequence information is used within NCF does not affect alignment quality, while the inclusion of topological information is crucial. Finally, larger neighborhood sizes are preferred, but often, it is the second largest size that is superior, and using this size would decrease computational complexity. Together, our results give several general recommendations for a fair evaluation of network alignment methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑