Bipartite graph search optimization for type ii diabetes mellitus jamu formulation using branch and bound algorithm

HIGHLIGHTS

• who: August et al. from the Research, India AIMST University, Malaysia have published the article: Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm, in the Journal: (JOURNAL)
• what: The authors specifically apply the proposed method to search for the Jamu formula for type II diabetes_mellitus (T2DM) disease. This research proposes a new approach using the graph traversing technique to overcome the limitation of machine_learning approaches. In this study, a tree representing DTI was built, and the unknown interactions were determined based on similarity measurements among compounds and . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.