Comparing flux networks through weighted graphs alignment

• Published in: 2019 IEEE International Work Conference on Bioinspired Intelligence (IWOBI) pp. 000093 - 000098
• Main Authors: Arias-Mendez, Esteban, Montero-Marin, Alonso, Torres-Rojas, Francisco J.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.07.2019
• Subjects: global alignment; graph traversal; local alignment; Needleman-Wunsch algorithm; Smith-Waterman algorithm
• DOI: 10.1109/IWOBI47054.2019.9114478

We present the importance of flux network analysis as weighted graphs and one of the main tasks we perform on them as it is the comparison as a first approach. With the introduction of a new simple and low cost comparison based on previous developed algorithms to compare general graphs and metabolic pathways. We propose two alternative approaches to analyze the associated weighted graphs of flux networks and provide a fast but accurate scoring of its flux similarities on the first place and a list of similarities and differences between the given graphs as second, listed as pathways or individual edges. In this work we propose an extension as a simple way to compare weighted graphs (not considered before) to be applied as possible flux analysis. We provide insights about the simple analysis follow to get a good score system when comparing weighted graphs in a low cost computation. Also we provide and alternative way to get a valid comparison beyond a score, that is given to the interested user a more intuitive way to look for the similar data (or differences) during the analysis.