[论文解读] Network comparison using directed graphlets

David Aparício, Pedro Ribeiro+1 more|arXiv (Cornell University)|Nov 6, 2015

Bioinformatics and Genomic NetworksBiochemistry, Genetics and Molecular Biology参考文献 39被引用 18

一句话总结

本文提出有向图谱（directed graphlets）作为无向图谱在生物网络中捕捉方向性拓扑结构的推广。通过使用 g-trie 数据结构将图谱分析扩展至有向网络，作者开发了 gtrieScanner——一种高效工具，其运行速度优于现有最先进方法，支持任意大小的有向与无向图谱，从而实现按类型准确分类网络。

ABSTRACT

With recent advances in high-throughput cell biology the amount of cellular biological data has grown drastically. Such data is often modeled as graphs (also called networks) and studying them can lead to new insights into molecule-level organization. A possible way to understand their structure is by analysing the smaller components that constitute them, namely network motifs and graphlets. Graphlets are particularly well suited to compare networks and to assess their level of similarity but are almost always used as small undirected graphs of up to five nodes, thus limiting their applicability in directed networks. However, a large set of interesting biological networks such as metabolic, cell signaling or transcriptional regulatory networks are intrinsically directional, and using metrics that ignore edge direction may gravely hinder information extraction. The applicability of graphlets is extended to directed networks by considering the edge direction of the graphlets. We tested our approach on a set of directed biological networks and verified that they were correctly grouped by type using directed graphlets. However, enumerating all graphlets in a large network is a computationally demanding task. Our implementation addresses this concern by using a state-of-the-art data structure, the g-trie, which is able to greatly reduce the necessary computation. We compared our tool, gtrieScanner, to other state-of-the art methods and verified that it is the fastest general tool for graphlet counting.

研究动机与目标

• 为解决无向图谱在捕捉代谢、信号传导和调控网络等生物网络中方向性拓扑特征方面的局限性。
• 开发一种可扩展且高效的算法，用于枚举任意大小的有向图谱，克服大规模网络分析中的计算瓶颈。
• 通过利用边的方向，借助有向图谱实现更精确的网络比较与按类型分类，提升结构洞察力。
• 构建一个通用工具，支持图谱与网络基序的枚举，并允许用户自定义子图查询。

提出的方法

• 通过在子图同构中考虑边的方向，将图谱框架推广至有向网络，从而识别出非同构的有向子图作为有向图谱。
• 采用 g-trie 数据结构紧凑表示并高效枚举所有可能的图谱（至给定大小），显著减少冗余计算。
• 使用递归方程组从低阶图谱频率计算高阶图谱频率，最小化对网络的重复遍历。
• 实现灵活的查询接口，允许用户指定自定义图谱或基序集合进行分析，提升工具的适应性。
• 通过 g-trie 的能力高效索引与遍历子图模式，尤其在大规模网络中显著优化性能。
• 在单一统一框架与实现中同时支持无向与有向图谱，以及网络基序。

实验结果

研究问题

• RQ1 有向图谱能否有效区分不同类型的生物网络，如代谢网络、信号传导网络和转录调控网络？
• RQ2 在图谱分析中引入边的方向，相较于无向图谱，能在多大程度上提升对结构差异的检测能力？
• RQ3 与现有工具相比，g-trie 数据结构在大规模有向网络中能否显著加速图谱枚举？
• RQ4 gtrieScanner 在各种网络类型与规模下，与现有最先进工具相比，在图谱与网络基序枚举方面的性能表现如何？

主要发现

• 有向图谱成功按网络类型对生物网络进行了分组，证明其能够捕捉无向图谱所忽略的有意义的拓扑差异。
• gtrieScanner 在无向图上的平均加速比达到近两个数量级，优于网络基序工具（如 Kavosh、FANMOD），在有向图上实现了约 20 倍的加速。
• 该工具在支持更大规模与有向图谱方面优于 GraphCrunch 与 ORCA（二者仅支持大小 ≤5 的无向图谱）。
• gtrieScanner 是目前最快的通用图谱与基序计数工具，具备卓越的可扩展性与灵活性，适用于任意子图查询。
• 基于 g-trie 索引的递归方程显著降低了计算开销，尤其在处理较大图谱时，且未牺牲准确性。
• 该方法可高效分析具有重要生物意义的方向性网络，如转录调控与信号传导通路。