Proposal for metabolic flux pathways comparison
Guardado en:
| Autores: | , , |
|---|---|
| Formáid: | artículo original |
| Stádas: | Versión publicada |
| Fecha de Publicación: | 2020 |
| Cur Síos: | Metabolic flux pathway analysis can provide important information for a better understanding of life and all its processes directly benefiting areas like medicine, agronomy, pharmacy and others alike. Some of the main tools used to study and analyze metabolic pathways have been based on the idea of pathway comparison, using graph data structures. Some of those tasks are considered hard computational problems. On the other hand, those comparisons have not yet taken into consideration the metabolic flux as part of the pathway or metabolic process. It means, to consider how much of a metabolite passes through a reaction system over time. We propose here a simple way to compare metabolic pathways using its related flux information by a simple metabolic pathway comparison method introduced in 2017 and adjusting it to weighted graphs. The algorithms analyze the associated weighted graphs of metabolic flux pathways and provide a fast scoring of its flux similarities in the first place and a list of similarities and differences between the given flux pathways, listed as pathways. We provide some insights into the analysis follow to get a good score system when comparing metabolic pathways related weighted graphs in a low-cost computation. |
| País: | Portal de Revistas TEC |
| Institiúid: | Instituto Tecnológico de Costa Rica |
| Repositorio: | Portal de Revistas TEC |
| Teanga: | Inglés |
| OAI Identifier: | oai:ojs.pkp.sfu.ca:article/5072 |
| Rochtain Ar Líne: | https://revistas.tec.ac.cr/index.php/tec_marcha/article/view/5072 |
| Palabra clave: | Graph traversal weighted graphs Needleman-Wunsch algorithm global alignment Smith-Waterman algorithm local alignment. grafos ponderados algoritmo Needleman-Wunsch alineamiento global algoritmo Smith-Waterman alineamiento local Recorrido de grafos |