Detection of Prostate Cancer Related Genes using Modified Ford-Fulkerson Algorithm in Protein-to-Protein Interaction Network
Sanjeev Prakashrao Kaulgud1, Vishwanath Hulipalled2, Siddanagouda Somanagouda Patil3

1Sanjeev Prakashrao Kaulgud, Department of Computer Science & Engineering, REVA and Presidency University, Bengaluru, India.
2Vishwanath Hulipalled, School of Computing and Information Technology, REVA University, Bengaluru, India.
3Siddanagouda Somanagouda Patil, Department of Agri Stat, Applied Maths & Computer Science, University of Agricultural Sciences, Bengaluru, India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 1595-1601 | Volume-8 Issue-6, August 2019. | Retrieval Number: F8198088619/2019©BEIESP | DOI: 10.35940/ijeat.F8198.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: Prostate cancer is a malignancy cancer that affects prostate epithelial cells. Presently, prostate cancer is the second leading cause of cancer-related death in men. In this research, a new computational system was proposed for determining the prostate cancer related genes with the shortest path methodology in a Protein to Protein Interaction (PPI) network. Here, a weighted PPI network was constructed on the basis of PPI data from Search Tool for the Retrieval of Interacting Genes/Proteins (STRING) database. Totally, eighteen prostate related genes were extracted from the STRING database by using Kyoto Encyclopedia of Genes and Genomes (KEGG) pathway. Then, the shortest path between eighteen genes was identified using modified Ford-Fulkerson algorithm. Generally, the conventional Ford-Fulkerson algorithm was very effective in detecting the shortest path between the prostate cancer-related genes, but the elapsed time was high when the PPI network has more number of genes. In order to reduce the elapsed time, the modified Ford Fulkerson algorithm was developed by eliminating the invalid path in gene connection. In the experimental section, the proposed shortest path approach reduced the elapsed time up to 0.025-0.002 seconds compared to the existing shortest path methodologies.
Keywords: Modified Ford-Fulkerson algorithm, prostate cancer, protein to protein interaction, and shortest path.