A method for querying conserved subnetwork in a large-scale biomolecular network

Abstract

To uncover conserved pathways using systems biology methods, comparing various kinds of networks among different species or within a species becomes an increasingly important problem. With more and more molecular data being available, most of the current methods cannot deal with the large-scale networks owing to the computational scale limitation on a single PC or workstation. In this paper, we adopted an Immediate Neighbors-in-first Method for the biomolecular network querying problem. In contrast to other methods, we developed the parallel computing algorithm to treat large-scale networks. The efficient parallel performance of the present method is shown by Parkinson's Disease related protein interaction network. © 2010 Springer-Verlag.