TY - JFULL AU - Razvan Bocu and Dr Sabin Tabirca PY - 2009/5/ TI - Sparse Networks-Based Speedup Technique for Proteins Betweenness Centrality Computation T2 - International Journal of Computer and Information Engineering SP - 975 EP - 983 VL - 3 SN - 1307-6892 UR - https://publications.waset.org/pdf/10230 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 28, 2009 N2 - The study of proteomics reached unexpected levels of interest, as a direct consequence of its discovered influence over some complex biological phenomena, such as problematic diseases like cancer. This paper presents the latest authors- achievements regarding the analysis of the networks of proteins (interactome networks), by computing more efficiently the betweenness centrality measure. The paper introduces the concept of betweenness centrality, and then describes how betweenness computation can help the interactome net- work analysis. Current sequential implementations for the between- ness computation do not perform satisfactory in terms of execution times. The paper-s main contribution is centered towards introducing a speedup technique for the betweenness computation, based on modified shortest path algorithms for sparse graphs. Three optimized generic algorithms for betweenness computation are described and implemented, and their performance tested against real biological data, which is part of the IntAct dataset. ER -