Cargando…
Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm
Jamu is an Indonesian traditional herbal medicine that has been practiced for generations. Jamu is made from various medicinal plants. Each plant has several compounds directly related to the target protein that are directly associated with a disease. A pharmacological graph can form relationships b...
Autores principales: | , , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Frontiers Media S.A.
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9403330/ https://www.ncbi.nlm.nih.gov/pubmed/36034833 http://dx.doi.org/10.3389/fphar.2022.978741 |
_version_ | 1784773351206551552 |
---|---|
author | Kusuma, Wisnu Ananta Habibi, Zulfahmi Ibnu Amir, Muhammad Fahmi Fadli, Aulia Khotimah, Husnul Dewanto, Vektor Heryanto, Rudi |
author_facet | Kusuma, Wisnu Ananta Habibi, Zulfahmi Ibnu Amir, Muhammad Fahmi Fadli, Aulia Khotimah, Husnul Dewanto, Vektor Heryanto, Rudi |
author_sort | Kusuma, Wisnu Ananta |
collection | PubMed |
description | Jamu is an Indonesian traditional herbal medicine that has been practiced for generations. Jamu is made from various medicinal plants. Each plant has several compounds directly related to the target protein that are directly associated with a disease. A pharmacological graph can form relationships between plants, compounds, and target proteins. Research related to the prediction of Jamu formulas for some diseases has been carried out, but there are problems in finding combinations or compositions of Jamu formulas because of the increase in search space size. Some studies adopted the drug–target interaction (DTI) implemented using machine learning or deep learning to predict the DTI for discovering the Jamu formula. However, this approach raises important issues, such as imbalanced and high-dimensional dataset, overfitting, and the need for more procedures to trace compounds to their plants. This study proposes an alternative approach by implementing bipartite graph search optimization using the branch and bound algorithm to discover the combination or composition of Jamu formulas by optimizing the search on a plant–protein bipartite graph. The branch and bound technique is implemented using the search strategy of breadth first search (BrFS), Depth First Search, and Best First Search. To show the performance of the proposed method, we compared our method with a complete search algorithm, searching all nodes in the tree without pruning. In this study, we specialize in applying the proposed method to search for the Jamu formula for type II diabetes mellitus (T2DM). The result shows that the bipartite graph search with the branch and bound algorithm reduces computation time up to 40 times faster than the complete search strategy to search for a composition of plants. The binary branching strategy is the best choice, whereas the BrFS strategy is the best option in this research. In addition, the the proposed method can suggest the composition of one to four plants for the T2DM Jamu formula. For a combination of four plants, we obtain Angelica Sinensis, Citrus aurantium, Glycyrrhiza uralensis, and Mangifera indica. This approach is expected to be an alternative way to discover the Jamu formula more accurately. |
format | Online Article Text |
id | pubmed-9403330 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Frontiers Media S.A. |
record_format | MEDLINE/PubMed |
spelling | pubmed-94033302022-08-26 Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm Kusuma, Wisnu Ananta Habibi, Zulfahmi Ibnu Amir, Muhammad Fahmi Fadli, Aulia Khotimah, Husnul Dewanto, Vektor Heryanto, Rudi Front Pharmacol Pharmacology Jamu is an Indonesian traditional herbal medicine that has been practiced for generations. Jamu is made from various medicinal plants. Each plant has several compounds directly related to the target protein that are directly associated with a disease. A pharmacological graph can form relationships between plants, compounds, and target proteins. Research related to the prediction of Jamu formulas for some diseases has been carried out, but there are problems in finding combinations or compositions of Jamu formulas because of the increase in search space size. Some studies adopted the drug–target interaction (DTI) implemented using machine learning or deep learning to predict the DTI for discovering the Jamu formula. However, this approach raises important issues, such as imbalanced and high-dimensional dataset, overfitting, and the need for more procedures to trace compounds to their plants. This study proposes an alternative approach by implementing bipartite graph search optimization using the branch and bound algorithm to discover the combination or composition of Jamu formulas by optimizing the search on a plant–protein bipartite graph. The branch and bound technique is implemented using the search strategy of breadth first search (BrFS), Depth First Search, and Best First Search. To show the performance of the proposed method, we compared our method with a complete search algorithm, searching all nodes in the tree without pruning. In this study, we specialize in applying the proposed method to search for the Jamu formula for type II diabetes mellitus (T2DM). The result shows that the bipartite graph search with the branch and bound algorithm reduces computation time up to 40 times faster than the complete search strategy to search for a composition of plants. The binary branching strategy is the best choice, whereas the BrFS strategy is the best option in this research. In addition, the the proposed method can suggest the composition of one to four plants for the T2DM Jamu formula. For a combination of four plants, we obtain Angelica Sinensis, Citrus aurantium, Glycyrrhiza uralensis, and Mangifera indica. This approach is expected to be an alternative way to discover the Jamu formula more accurately. Frontiers Media S.A. 2022-08-11 /pmc/articles/PMC9403330/ /pubmed/36034833 http://dx.doi.org/10.3389/fphar.2022.978741 Text en Copyright © 2022 Kusuma, Habibi, Amir, Fadli, Khotimah, Dewanto and Heryanto. https://creativecommons.org/licenses/by/4.0/This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms. |
spellingShingle | Pharmacology Kusuma, Wisnu Ananta Habibi, Zulfahmi Ibnu Amir, Muhammad Fahmi Fadli, Aulia Khotimah, Husnul Dewanto, Vektor Heryanto, Rudi Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm |
title | Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm |
title_full | Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm |
title_fullStr | Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm |
title_full_unstemmed | Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm |
title_short | Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm |
title_sort | bipartite graph search optimization for type ii diabetes mellitus jamu formulation using branch and bound algorithm |
topic | Pharmacology |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9403330/ https://www.ncbi.nlm.nih.gov/pubmed/36034833 http://dx.doi.org/10.3389/fphar.2022.978741 |
work_keys_str_mv | AT kusumawisnuananta bipartitegraphsearchoptimizationfortypeiidiabetesmellitusjamuformulationusingbranchandboundalgorithm AT habibizulfahmiibnu bipartitegraphsearchoptimizationfortypeiidiabetesmellitusjamuformulationusingbranchandboundalgorithm AT amirmuhammadfahmi bipartitegraphsearchoptimizationfortypeiidiabetesmellitusjamuformulationusingbranchandboundalgorithm AT fadliaulia bipartitegraphsearchoptimizationfortypeiidiabetesmellitusjamuformulationusingbranchandboundalgorithm AT khotimahhusnul bipartitegraphsearchoptimizationfortypeiidiabetesmellitusjamuformulationusingbranchandboundalgorithm AT dewantovektor bipartitegraphsearchoptimizationfortypeiidiabetesmellitusjamuformulationusingbranchandboundalgorithm AT heryantorudi bipartitegraphsearchoptimizationfortypeiidiabetesmellitusjamuformulationusingbranchandboundalgorithm |