Showing 1 - 10 results of 10 for search '(( binary high protein optimization algorithm ) OR ( binary snp based optimization algorithm ))*', query time: 0.49s Refine Results
  1. 1

    <i>hi</i>PRS algorithm process flow. by Michela C. Massi (14599915)

    Published 2023
    “…From this dataset we can compute the MI between each interaction and the outcome and <b>(D)</b> obtain a ranked list (<i>I</i><sub><i>δ</i></sub>) based on this metric. <b>(E)</b> Starting from the interaction at the top of <i>I</i><sub><i>δ</i></sub>, <i>hi</i>PRS constructs <i>I</i><sub><i>K</i></sub>, selecting <i>K</i> (where <i>K</i> is user-specified) terms through the greedy optimization of the ratio between MI (<i>relevance</i>) and a suitable measure of similarity for interactions (<i>redundancy)</i> (cf. …”
  2. 2

    Image1_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG by Wisnu Ananta Kusuma (9276182)

    Published 2022
    “…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. …”
  3. 3

    Image2_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG by Wisnu Ananta Kusuma (9276182)

    Published 2022
    “…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. …”
  4. 4

    Image4_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.jpg by Wisnu Ananta Kusuma (9276182)

    Published 2022
    “…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. …”
  5. 5

    Image5_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.jpg by Wisnu Ananta Kusuma (9276182)

    Published 2022
    “…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. …”
  6. 6

    Image3_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG by Wisnu Ananta Kusuma (9276182)

    Published 2022
    “…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. …”
  7. 7

    DataSheet1_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.docx by Wisnu Ananta Kusuma (9276182)

    Published 2022
    “…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. …”
  8. 8
  9. 9
  10. 10

    Supplementary Material 8 by Nishitha R Kumar (19750617)

    Published 2025
    “…</li><li><b>XGboost: </b>An optimized gradient boosting algorithm that efficiently handles large genomic datasets, commonly used for high-accuracy predictions in <i>E. coli</i> classification.…”