A genome-scale metabolic network alignment method within a hypergraph-based framework using a rotational tensor-vector product. Issue 1 (December 2018)

• Record Type: Journal Article
• Authors: Shen, Tie; Zhang, Zhengdong; Chen, Zhen; Gu, Dagang; Liang, Shen; Xu, Yang; Li, Ruiyuan; Wei, Yimin; Liu, Zhijie; Yi, Yin; Xie, Xiaoyao
• Is Part Of: Scientific reports. Volume 8:Issue 1(2018)
• Page Start: 1
• Page End: 16
• Publication Date: 2018-12
• Subjects: Natural history -- Research -- Periodicals; Biology -- Research -- Periodicals; Physical sciences -- Research -- Periodicals; Earth sciences -- Research -- Periodicals; Environmental sciences -- Research -- Periodicals; 502.85
• DOI: 10.1038/s41598-018-34692-1
• Languages: English
• ISSNs: 2045-2322

Abstract

Abstract Biological network alignment aims to discover important similarities and differences and thus find a mapping between topological and/or functional components of different biological molecular networks. Then, the mapped components can be considered to correspond to both their places in the network topology and their biological attributes. Development and evolution of biological network alignment methods has been accelerated by the rapidly increasing availability of such biological networks, yielding a repertoire of tens of methods based upon graph theory. However, most biological processes, especially the metabolic reactions, are more sophisticated than simple pairwise interactions and contain three or more participating components. Such multi-lateral relations are not captured by graphs, and computational methods to overcome this limitation are currently lacking. This paper introduces hypergraphs and association hypergraphs to describe metabolic networks and their potential alignments, respectively. Within this framework, metabolic networks are aligned by identifying the maximal Z-eigenvalue of a symmetric tensor. A shifted higher-order power method was utilized to identify a solution. A rotational strategy has been introduced to accelerate the tensor-vector product by 250-fold on average and reduce the storage cost by up to 1, 000-fold. The algorithm was implemented on a spark-based distributed computation cluster to significantly increase the convergence rate further by 50- to 80-fold. The parameters have been explored to understand their impact on alignment accuracy and speed. In particular, the influence of initial value selection on the stationary point has been simulated to ensure an accurate approximation of the global optimum. This framework was demonstrated by alignments among the genome-wide metabolic networks ofEscherichia coli MG-1655 andHalophilic archaeon DL31. To our knowledge, this is the first genome-wide metabolic network alignment at both the metabolite level and the enzyme level. These results demonstrate that it can supply quite a few valuable insights into metabolic networks. First, this method can access the driving force of organic reactions through the chemical evolution of metabolic network. Second, this method can incorporate the chemical information of enzymes and structural changes of compounds to offer new way defining reaction class and module, such as those in KEGG. Third, as a vertex-focused treatment, this method can supply novel structural and functional annotation for ill-defined molecules. The related source code is available on request.