A Parallel Method for Querying Target Subnetwork in a Biomolecular Network

A Parallel Method for Querying Target Subnetwork in a Biomolecular Network

Year:    2012

International Journal of Numerical Analysis and Modeling, Vol. 9 (2012), Iss. 2 : pp. 326–337

Abstract

Similarity analysis of biomolecular networks among different species or within one species is an efficient approach to understand evolution or disease. The more data from biological experiment, the larger networks. Sequential computational limitation on single PC or workstation have to be considered when methods are developed. The Immediate Neighbors-in-first Method is a method for querying the subnetwork which is most similar to the target in a biomolecular network. Parallel algorithm for it to treat large-scale networks is developed and the parallel performance is evaluated in this paper. Moreover, we apply the present method to two groups of tests on real biological data including protein interaction networks of Fly and Yeast and metabolic networks of Yeast and E. coli. Several conserved protein interactions and metabolic pathways are found and some new protein interactions and functions are predicted.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/2012-IJNAM-631

International Journal of Numerical Analysis and Modeling, Vol. 9 (2012), Iss. 2 : pp. 326–337

Published online:    2012-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    12

Keywords:    Biomolecular network network querying parallel computing.