[1] XIE J, XIANG C, MA J, et al. An adaptive hybrid algorithm for global network alignment[J]. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2016, 13(3):483-493. [2] MILO R, SHEN-ORR S, ITZKOVITZ S, et al. Network motifs:simple building blocks of complex networks[J]. Science, 2002, 298(5594):824-827. [3] 赵静,钟诚.HashESU:一种生物网络模体识别高效方法[J].小型微型计算机系统,2015,36(9):2042-2046.(ZHAO J, ZHONG C. HashESU:an efficient algorithm for identifying motifs in biological networks[J]. Journal of Chinese Computer Systems, 2015, 36(9):2042-2046.) [4] KIM W, HAUKAP L. NemoProfile as an efficient approach to network motif analysis with instance collection[J]. BMC Bioinformatics, 2017, 18(S12):37-45. [5] WERNICKE S. Efficient detection of network motifs[J]. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2006, 3(4):347-359. [6] RIBEIRO P, SILVA F, LOPES L. Efficient parallel subgraph counting using G-tries[C]//Proceedings of the 2010 International Conference on Cluster Computing. Piscataway, NJ:IEEE, 2011:217-226. [7] KHAKABIMAMAGHANI S, SHARAFUDDIN I, DICHTER N, et al. QuateXelero:an accelerated exact network motif detection algorithm[J]. PLoS One, 2013, 8(7):e68073. [8] LUO J, DING L, LIANG C, et al. An efficient network motif discovery approach for co-regulatory networks[J]. IEEE Access, 2018, 6:14151-14158. [9] KIPPS M, KIM W, FUKUDA M. Agent and spatial based parallelization of biological network motif search[C]//Proceedings of the 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems. Piscataway, NJ:IEEE, 2015:786-791. [10] RIBEIRO P, SILVA F, LOPES L. Parallel calculation of subgraph census in biological networks[C]//BIOINFORMATICS 2010:Proceedings of the First International Conference on Bioinformatics. Valencia:INSTICC Press, 2010:56-65. [11] 覃桂敏,高琳,呼加璐.生物网络模体发现算法研究综述[J].电子学报,2009,37(10):2258-2264.(QIN G M, GAO L, HU J L. A review on algorithms for network motif discovery in biological networks[J]. Acta Electronica Sinica, 2009, 37(10):2258-2264.) [12] MCKAY B. Practical graph isomorphism[J]. Congressus Numerantium, 1981, 30:45-81. [13] HAGBERG A, SCHULT D, SWART P. Exploring network structure, dynamics, and function using NetworkX[R]. Los Alamos, NM:Los Alamos National Lab, 2008. [14] BARABASI A, ALBERT R. Emergence of scaling in random networks[J]. Science, 1999, 286(5439):509-512. [15] WATTS D, STROGATZ S. Collective dynamics of ‘small-world’ networks[J]. Nature, 1998, 393(6684):440-442. [16] KIM J, VU V H. Generating random regular graphs[C]//Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing. New York:ACM, 2003:213-222. [17] SNEL B, LEHMANN G, BORK P, et al. STRING:a Web-server to retrieve and display the repeatedly occurring neighbourhood of a gene[J]. Nucleic Acids Research, 2000, 28(18):3442-3444. [18] BARABASI A, OLTVAI Z. Network biology:understanding the cell's functional organization[J]. Nature Reviews Genetics, 2004, 5(2):101-113. |