Network propagation identifies ageing-associated genes as well as genes distinguishing prostate tumors of different grades. by Konstantina Charmpi (9901053)

Screening MMRG gene variables associated with UC based on the optimal machine learning model. by Li Li (14993)

Optimal ALARM BN discovered by CausNet. by Nand Sharma (21519845)

“…<div><p>In our recent work, we developed a novel dynamic programming algorithm to find optimal Bayesian networks with parent set constraints. …”

DataSheet_1_Comparative analysis of assembly algorithms to optimize biosynthetic gene cluster identification in novel marine actinomycete genomes.docx by Daniela Tizabi (10297654)

DataSheet_2_Comparative analysis of assembly algorithms to optimize biosynthetic gene cluster identification in novel marine actinomycete genomes.pdf by Daniela Tizabi (10297654)

Optimal image settings for object detection of Iba1 immunolabelled cells in DAB. by Danish M. Anwer (15383441)

DataSheet1_Optimal Sparsity Selection Based on an Information Criterion for Accurate Gene Regulatory Network Inference.PDF by Deniz Seçilmiş (13028616)

DataSheet1_Optimal Sparsity Selection Based on an Information Criterion for Accurate Gene Regulatory Network Inference.PDF by Deniz Seçilmiş (13028616)

Expression values and standard errors of genes within each patient group under the optimal feature filtering method (ALOGA < 128) used for (blue bars) distinguishing each individua... by Song Cui (553627)

Table 1_Leveraging a disulfidptosis-based signature to characterize heterogeneity and optimize treatment in multiple myeloma.docx by Bingxin Zhang (13011397)

DataSheet1_Comprehensive analysis of immune-related gene signature based on ssGSEA algorithms in the prognosis and immune landscape of hepatocellular carcinoma.ZIP by Liangliang Wang (580395)

“…</p><p>Results: Immune cluster analysis based on ssGSEA could well distinguish the TIME characteristics of patients with HCC. …”

Summary of datasets used. by Stephen R. Piccolo (8367780)

DataSheet_1_Trans-population graph-based coverage optimization of allogeneic cellular therapy.xlsx by Sapir Israeli (15415241)

“…We propose here a solution to this problem, and test whether it would be more expensive to recruit additional donors or to prevent class I or class II HLA expression through gene editing.</p>Study design<p>We developed an optimal coverage problem, combined with a graph-based algorithm to solve the donor selection problem under different, clinically plausible scenarios (having different HLA matching priorities). …”

DataSheet_1_Trans-population graph-based coverage optimization of allogeneic cellular therapy.xlsx by Sapir Israeli (15415241)

“…We propose here a solution to this problem, and test whether it would be more expensive to recruit additional donors or to prevent class I or class II HLA expression through gene editing.</p>Study design<p>We developed an optimal coverage problem, combined with a graph-based algorithm to solve the donor selection problem under different, clinically plausible scenarios (having different HLA matching priorities). …”

DataSheet_1_Trans-population graph-based coverage optimization of allogeneic cellular therapy.xlsx by Sapir Israeli (15415241)

“…We propose here a solution to this problem, and test whether it would be more expensive to recruit additional donors or to prevent class I or class II HLA expression through gene editing.</p>Study design<p>We developed an optimal coverage problem, combined with a graph-based algorithm to solve the donor selection problem under different, clinically plausible scenarios (having different HLA matching priorities). …”

FDR and Runtime for ALARM. by Nand Sharma (21519845)

“…<div><p>In our recent work, we developed a novel dynamic programming algorithm to find optimal Bayesian networks with parent set constraints. …”

FDR (). by Nand Sharma (21519845)

“…<div><p>In our recent work, we developed a novel dynamic programming algorithm to find optimal Bayesian networks with parent set constraints. …”

FDR (). by Nand Sharma (21519845)

“…<div><p>In our recent work, we developed a novel dynamic programming algorithm to find optimal Bayesian networks with parent set constraints. …”

Average Runtime in seconds. by Nand Sharma (21519845)

“…<div><p>In our recent work, we developed a novel dynamic programming algorithm to find optimal Bayesian networks with parent set constraints. …”

ALARM networks with different partial orderings. by Nand Sharma (21519845)

“…<div><p>In our recent work, we developed a novel dynamic programming algorithm to find optimal Bayesian networks with parent set constraints. …”