Network analysis is one of the hottest areas of research in biotechnology and biomedical research. It is a straight forward method of representing local and global characteristics of biological nodes representing the various biological elements. In network analysis, we use mathematical graph theory to show the interaction among the genes and its product. This represents the various biological activities in the cell. In order to predict the certain activity and interaction among the biological elements, it is necessary to find the optimal path in the network. This optimal path is usually the shortest path, which clearly depicts the key elements involved for the particular reaction. It is also necessary to count the number of shortest paths between the given pairs of genes in the network. This paper describes the need for finding shortest path in the biological network and illustrate the usage of Bellman-Ford algorithm to find the shortest path in Hutchinson-Gilford Progeria Syndrome (HGPS) data sets.
목차
Abstract 1. Introduction 2. Background and Literature Review 3. Methodology 3.1. Need for Shortest Path Prediction 3.2. Bellman-Ford Algorithm 4. Results and Discussion 5. Conclusion References
N. Senthilkumaran [ Department of Computer Science and Applications The Gandhigram Rural Institute (Deemed to be University),Gandhigram, India ]
Corresponding author
S. Sivagurunathan [ Department of Computer Science and Applications The Gandhigram Rural Institute (Deemed to be University),Gandhigram, India ]
한국AI디지털융합학회(구 한국디지털융합학회) [The Korean Academic Society of AI Digital Convergence]
설립연도
2015
분야
사회과학>경영학
소개
본 학회는 디지털 경영에 관련된 디지털 미디어, 디지털 통신, 디지털 방송, 디지털 콘텐츠, 디지털 문화, 디지털 사회, 디지털 유통, 디지털 금융, 디지털 물류, 디지털 정책, 디지털 기술, 디지털 교육 그리고 디지털과 아날로그의 비교 등에 대한 학제간 연구와 실사구시적인 적용을 통하여 디지털 경영의 발전과 한국이 세계적인 디지털 강국으로 성장하기 위한 학술적인 기반과 실무적인 지침을 조성하는 것을 목적으로 하고 있습니다.
간행물
간행물명
IJICTDC [International Journal of Information Communication Technology and Digital Convergence]