Faculty Advisor

Korkin, Dmitry

Faculty Advisor

Wu, Zheyang

Abstract

One of the most significant advancements in modern medicine has been the discovery of relationships between diseases and certain genes. These “disease genes” enable doctors to pinpoint the exact location of the disease. In 2015, a group of scientists developed an algorithm known as DIAMOnD in order to find more disease genes. DIAMOnD examines the significance of the connections between genes in a network and the set of disease genes, and then adds the most significantly connected gene to the set of disease genes. For this project, I sought to improve the performance of DIAMOnD to more accurately determine the next disease gene to be added. To do this, I changed the probability distribution used by the algorithm and tested both algorithms on certain diseases and networks.

Publisher

Worcester Polytechnic Institute

Date Accepted

April 2017

Major

Computer Science

Major

Mathematical Sciences

Project Type

Major Qualifying Project

Accessibility

Unrestricted

Advisor Department

Computer Science

Advisor Department

Mathematical Sciences

Share

COinS