ArticleBioinformatics (Oxford, England)2021
Learning graph representations of biochemical networks and its application to enzymatic link prediction.
Article in Bioinformatics (Oxford, England), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 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
7 citing papers in PubMed.
- AI-Guided Long Non-Coding RNA Target Discovery for Precision Medicine: Integrating GWAS, Multi-Omics, Experimental Validation, and RNA Therapeutics.Biomedicines · 2026Review
- Computational approaches to enzymatic reaction assignment: a review of methods, validations, and future directions.Briefings in bioinformatics · 2025Review
- Article
- High-throughput prediction of enzyme promiscuity based on substrate-product pairs.Briefings in bioinformatics · 2024Article
- Using graph neural networks for site-of-metabolism prediction and its applications to ranking promiscuous enzymatic products.Bioinformatics (Oxford, England) · 2023Article
- Boost-RS: boosted embeddings for recommender systems and its application to enzyme-substrate interaction prediction.Bioinformatics (Oxford, England) · 2022Article
- Enzyme Promiscuity Prediction Using Hierarchy-Informed Multi-Label Classification.Bioinformatics (Oxford, England) · 2021Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
motivationThe complete characterization of enzymatic activities between molecules remains incomplete, hindering biological engineering and limiting biological discovery. We develop in this work a technique, enzymatic link prediction (ELP), for predicting the likelihood of an enzymatic transformation between two molecules. ELP models enzymatic reactions cataloged in the KEGG database as a graph. ELP is innovative over prior works in using graph embedding to learn molecular representations that capture not only molecular and enzymatic attributes but also graph connectivity.
resultsWe explore transductive (test nodes included in the training graph) and inductive (test nodes not part of the training graph) learning models. We show that ELP achieves high AUC when learning node embeddings using both graph connectivity and node attributes. Further, we show that graph embedding improves link prediction by 30% in area under curve over fingerprint-based similarity approaches and by 8% over support vector machines. We compare ELP against rule-based methods. We also evaluate ELP for predicting links in pathway maps and for reconstruction of edges in reaction networks of four common gut microbiota phyla: actinobacteria, bacteroidetes, firmicutes and proteobacteria. To emphasize the importance of graph embedding in the context of biochemical networks, we illustrate how graph embedding can guide visualization. AVAILABILITY AND IMPLEMENTATION: The code and datasets are available through https://github.com/HassounLab/ELP.
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.