ceragoguztuzun Goto Github PK

431-2021

Fall 2021 repository for PQHS / CRSP / MPHP 431 with Dr. Thomas Love

459-drug-proj

Drug Repurposing - Network-Based Analysis

ahocorasick

that's sick.

amia2023-supplementary-data

This repository contains the Supplementary Data for the paper submission for PSB 2023.

bicome

B.I.C.O.M.E. is a biology simulation game that aims help to the who is interested

binary-classification-on-odir5k-dataset-with-cnn-

binary classification on Ocular Disease Recognition, ODIR5k, dataset

catan-desktop

The Settlers of the Catan is a strategy game played by 3-4 people where everyone plays in turns. The game starts by assembling hexagonal map pieces and shuffling and placing the cards. Each player chooses his/her figure to play with. Construction price cards are distributed to players where the information about construction such as village or cities and the points they provide are written. At the beginning of the first turn, the player who has the turn rolls two die and place villages and roads on the map to a place he desires. After each player settles his/her first villages and roads, the competition starts. In each tour, the player rolls the die and can collect sources, buy or use development cards, trade (swap sources), and do construction. After the die are rolled, players who have own constructions lying on that numbered map gains sources. There are five types of source cards which are wood, brick, iron, sheep, and wheat. These source cards are utilized while doing construction and buying development cards. If the sum of numbers on the die is seven, each player who has seven or more cards places half of them to the chest, also the player who has rolled the die can place the thief figure on wherever place on map he/she wishes where the next player won't be able to get source cards from that place. The player who places the thief gets a random source card from each player who owns construction in that place. The player who owns the tour can trade his/her source cards with other players or the chest. In order to construct a village, the player must reach that part of the game by building roads. Villages can be upgraded to cities. There are three types of development cards that add more game functionality to the game. If a player collects 10 points from constructions and cards, the player wins and the game ends.

desert-bug

WebGL Animation

exactpatternmatching

hiv-1-protease-cleavage-naive-bayes-model

kochcurve-webgl

computer graphics homework 1

mbg102-lab-reports

The reports of the experiments I did throughout the MBG102 course of Spring 21' !

medianstringsearch

motifgenie

MotifGenie is a Python command line tool for searching transcription factor binding motif sequences in merged ChIP-Seq binding sites. First, MotifGenie analyzes multiple ChIP-Seq samples simultaneously to identify shard binding regions for a locus of interest, then, searches the binding motif sequence of a given transcription factor in these shared binding regions.

os-processes-ipc-threads

os-project-3

os-project-4

os-threads-synchronization

paperlanguageparser

Programmin Languages Project. Checks whether or not a program text is a valid Paper program code.

precisiondrugrepurposing

ray-tracing-webgl

semantic-segmentation-of-prostate-gland-mri

sequence-alignment

Given two DNA sequences in a single FASTA-formatted file, both global and local alignment algorithms that use naı̈ve and affine gap penalties are implemented with a hard-coded scoring matrix.

sequence-to-profile-alignment

simple-php-hw

super cute

socket-programming-cryptography

a Java code to simulate a client which communicates with a server in an encrypted way using a simple, custom security protocol, which will be implemented using Transmission Control Protocol (TCP) sockets of Java socket API.

statistical-analysis-practice

Some labs and projects done in R demonstrating some statistical analyses like there is no tomorrow...

svm-logistic-regression-pca

Classifying aquatic animals which is a subset of CIFAR100 dataset.

xgboost-from-scratch-ltr

In this project, a simple XGBoost Regression algorithm is implemented using pure Python, for the learning to rank objectives. The Basic Exact Greedy Algorithm is used for the split finding algorithm. Optimizations such as column subsampling and shrinkage are not implemented. The gain score is used as the structure score for each leaf. Then, the evaluation metrics of Accuracy, Root Mean Square Error, F1 Score are presented, as well as plotted. The implementation of the evaluation metrics are obtained from sklearn. But, apart from that, the implementation is done using pandas and numpy packages. Ranking is done by rounding and sorting of the predicted regression values.

zoo