TY  - JOUR
T1  - Shortest Path Enhancement using Improved Bellman Ford Algorithm in PPI
AU - Praveen, Tumuluru AU - Ravi, Bhramaramba 
JO  - Journal of Engineering and Applied Sciences
VL  - 12
IS  - 22
SP  - 6088
EP  - 6094
PY  - 2017
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2017.6088.6094
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2017.6088.6094
KW  - Chemotherapy
KW  -improved Bellman Ford algorithm
KW  -lung cancer
KW  -protein-protein interaction
KW  -database
KW  -lifetime
AB  - The chance that a man will develop lung cancer in his lifetime is about 1 in 14 and for a woman, the
risk is about 1 in 17. The lung cancer can be cured only by the surgery alone in the early stage, no
chemotherapy or radiation therapy is needed. There are cases where chemotherapy does not work in the
stage 4. The shortest path in Protein-Protein Interaction (PPI) plays a vital role in identifying the cancer at an
early stage. The identification of the cancer gene in the PPI is prolonged. This study proposed the improved
bellman ford which is the optimized and efficient way to find the shortest path in the PPI network. PPI is
constructed by obtaining the data from the Search Tool for the Retrieval of Interacting Genes/Proteins
(STRING) and Kyoto Encyclopedia of Genes and Genomes (KEGG) database.
ER  -