Bowdoin College, Brunswick, Maine, USA.
Brief Bioinform. 2012 Mar;13(2):202-15. doi: 10.1093/bib/bbr033. Epub 2011 Jun 20.
Network motifs are statistically overrepresented sub-structures (sub-graphs) in a network, and have been recognized as 'the simple building blocks of complex networks'. Study of biological network motifs may reveal answers to many important biological questions. The main difficulty in detecting larger network motifs in biological networks lies in the facts that the number of possible sub-graphs increases exponentially with the network or motif size (node counts, in general), and that no known polynomial-time algorithm exists in deciding if two graphs are topologically equivalent. This article discusses the biological significance of network motifs, the motivation behind solving the motif-finding problem, and strategies to solve the various aspects of this problem. A simple classification scheme is designed to analyze the strengths and weaknesses of several existing algorithms. Experimental results derived from a few comparative studies in the literature are discussed, with conclusions that lead to future research directions.
网络基元是网络中统计上过度表示的子结构(子图),并已被认为是“复杂网络的简单构建块”。研究生物网络基元可以揭示许多重要生物学问题的答案。在生物网络中检测更大的网络基元的主要困难在于以下事实:可能的子图数量随着网络或基元大小(通常为节点计数)呈指数级增长,并且不存在用于确定两个图在拓扑上是否等效的已知多项式时间算法。本文讨论了网络基元的生物学意义、解决基元发现问题的动机,以及解决该问题各个方面的策略。设计了一个简单的分类方案来分析几种现有算法的优缺点。讨论了从文献中的一些比较研究中得出的实验结果,得出了一些导致未来研究方向的结论。