On the complexity of average path length for biological networks and patterns  

作　　者：Waqar Asif Hassaan Khaliq Qureshi Adnan Iqbal Muttukrishnan Rajarajan 

机构地区：[1]National University of Sciences and Technology (NUST) Islamabad, Pakistan [2]Iqra University, Islamabad, Pakistan [3]School of Engineering and Mathematical Sciences City University, London, UK

出　　处：《International Journal of Biomathematics》2014年第4期51-61,共11页生物数学学报（英文版）

摘　　要：Path length calculation is a frequent requirement in studies related to graph theoretic problems such as genetics. Standard method to calculate average path length （APL） of a graph requires traversing all nodes in the graph repeatedly, which is computationally expensive for graphs containing large number of nodes. We propose a novel method to calculate APL for graphs commonly required in the studies of genetics. The proposed method is computationally less expensive and less time-consuming compared to standard method.

关 键 词：REDUCTIONISM average path length protein protein interaction. 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] O123.1[自动化与计算机技术—计算机科学与技术]