ArticlePloS one2017
Metabolomics analysis: Finding out metabolic building blocks.
Article in PloS one, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. An erratum has been issued. Cited by 9 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
9 citing papers in PubMed.
- Evolutionary signals in metabolic networks of insect endosymbionts revealed through comparative topological modeling.BMC genomics · 2026Article
- Topological and Functional Diversity of Gut Microbiota Metabolism Across the Human Lifespan.Metabolites · 2026Article
- Metadag: a web tool to generate and analyse metabolic networks.BMC bioinformatics · 2025Article
- Analysis of the saliva metabolic signature in patients with primary Sjögren's syndrome.PloS one · 2022Article
- Article
- The Metabolic Building Blocks of a Minimal Cell.Biology · 2020Article
- Circulating Metabolites as Potential Biomarkers for Neurological Disorders-Metabolites in Neurological Disorders.Metabolites · 2020Article
- An update on the Symbiotic Genomes Database (SymGenDB): a collection of metadata, genomic, genetic and protein sequences, orthologs and metabolic networks of symbiotic organisms.Database : the journal of biological databases and curation · 2020Article
- Article
Corrections and comments
- Erratum issued
Authors and funding
4 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
In this paper we propose a new methodology for the analysis of metabolic networks. We use the notion of strongly connected components of a graph, called in this context metabolic building blocks. Every strongly connected component is contracted to a single node in such a way that the resulting graph is a directed acyclic graph, called a metabolic DAG, with a considerably reduced number of nodes. The property of being a directed acyclic graph brings out a background graph topology that reveals the connectivity of the metabolic network, as well as bridges, isolated nodes and cut nodes. Altogether, it becomes a key information for the discovery of functional metabolic relations. Our methodology has been applied to the glycolysis and the purine metabolic pathways for all organisms in the KEGG database, although it is general enough to work on any database. As expected, using the metabolic DAGs formalism, a considerable reduction on the size of the metabolic networks has been obtained, specially in the case of the purine pathway due to its relative larger size. As a proof of concept, from the information captured by a metabolic DAG and its corresponding metabolic building blocks, we obtain the core of the glycolysis pathway and the core of the purine metabolism pathway and detect some essential metabolic building blocks that reveal the key reactions in both pathways. Finally, the application of our methodology to the glycolysis pathway and the purine metabolism pathway reproduce the tree of life for the whole set of the organisms represented in the KEGG database which supports the utility of this research.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.