Experiment 4: Evaluating modularity-based clustering methods on tree-of-cliques networks. by Yasamin Tabatabaee (18095491)

Performance of optimization algorithms in six different network types. by Maurits H. W. Oostenbroek (11331123)

Calibration plots for all models on the Derivation cohort. by Agni Orfanoudaki (8878097)

Most cost-effective option* when TCZ is available. by Gabrielle Bonnet (11614471)

Identification and quantitation of clinically relevant microbes in patient samples: Comparison of three k-mer based classifiers for speed, accuracy, and sensitivity by George S. Watts (7962206)

“…Adopting metagenomic analysis for clinical use requires that all aspects of the workflow are optimized and tested, including data analysis and computational time and resources. …”

Table_1_Distinguishing HapMap Accessions Through Recursive Set Partitioning in Hierarchical Decision Trees.pdf by Wenchao Zhang (1324959)

“…Based on these algorithms, we developed a web tool named MAD-HiDTree (Multiple Accession Distinguishment-Hierarchical Decision Tree), designed to analyze a user-input genotype matrix and construct a hierarchical decision tree. …”

Table_2_Distinguishing HapMap Accessions Through Recursive Set Partitioning in Hierarchical Decision Trees.pdf by Wenchao Zhang (1324959)

“…Based on these algorithms, we developed a web tool named MAD-HiDTree (Multiple Accession Distinguishment-Hierarchical Decision Tree), designed to analyze a user-input genotype matrix and construct a hierarchical decision tree. …”

Presentation_1_Distinguishing HapMap Accessions Through Recursive Set Partitioning in Hierarchical Decision Trees.pdf by Wenchao Zhang (1324959)

“…Based on these algorithms, we developed a web tool named MAD-HiDTree (Multiple Accession Distinguishment-Hierarchical Decision Tree), designed to analyze a user-input genotype matrix and construct a hierarchical decision tree. …”

Table_3_Distinguishing HapMap Accessions Through Recursive Set Partitioning in Hierarchical Decision Trees.pdf by Wenchao Zhang (1324959)

“…Based on these algorithms, we developed a web tool named MAD-HiDTree (Multiple Accession Distinguishment-Hierarchical Decision Tree), designed to analyze a user-input genotype matrix and construct a hierarchical decision tree. …”

Image_1_Distinguishing HapMap Accessions Through Recursive Set Partitioning in Hierarchical Decision Trees.tif by Wenchao Zhang (1324959)

“…Based on these algorithms, we developed a web tool named MAD-HiDTree (Multiple Accession Distinguishment-Hierarchical Decision Tree), designed to analyze a user-input genotype matrix and construct a hierarchical decision tree. …”

Data_Sheet_1_Distinguishing HapMap Accessions Through Recursive Set Partitioning in Hierarchical Decision Trees.zip by Wenchao Zhang (1324959)

“…Based on these algorithms, we developed a web tool named MAD-HiDTree (Multiple Accession Distinguishment-Hierarchical Decision Tree), designed to analyze a user-input genotype matrix and construct a hierarchical decision tree. …”

Data_Sheet_3_Distinguishing HapMap Accessions Through Recursive Set Partitioning in Hierarchical Decision Trees.zip by Wenchao Zhang (1324959)

“…Based on these algorithms, we developed a web tool named MAD-HiDTree (Multiple Accession Distinguishment-Hierarchical Decision Tree), designed to analyze a user-input genotype matrix and construct a hierarchical decision tree. …”

Data_Sheet_2_Distinguishing HapMap Accessions Through Recursive Set Partitioning in Hierarchical Decision Trees.zip by Wenchao Zhang (1324959)

“…Based on these algorithms, we developed a web tool named MAD-HiDTree (Multiple Accession Distinguishment-Hierarchical Decision Tree), designed to analyze a user-input genotype matrix and construct a hierarchical decision tree. …”

Performance of pairing prediction versus training set size and number of pairs per species. by Guillaume Marmier (7495823)

“…<p><b>A</b>: Fraction of pairs correctly identified (TP fraction) versus training set size, for DCA-, MI-, and Mirrortree-based methods. The three pairing scores corresponding to each of these three methods are employed in two ways: either within each species we find the chain B with optimal pairing score with each chain A (dashed lines), or within each species we employ the Hungarian matching algorithm to find the one-to-one pairing of chains A and B that optimizes the sum of the pairing scores (solid lines). …”

Data_Sheet_1_Driving behavior characterization and traffic emission analysis considering the vehicle trajectory.pdf by Xuejiao Du (12395488)

Data_Sheet_1_A Data-Driven Framework for Identifying Intensive Care Unit Admissions Colonized With Multidrug-Resistant Organisms.docx by Çaǧlar Çaǧlayan (12253934)

“…We performed threshold optimization for converting predicted probabilities into binary predictions and identified the cut-off maximizing the sum of sensitivity and specificity.…”