The Community for Technology Leaders
Green Image
Issue No. 04 - July/August (2011 vol. 8)
ISSN: 1545-5963
pp: 876-889
Luigi Palopoli , University of Calabria, Rende (Cosenza)
Nicola Ferraro , University of Calabria, Rende (Cosenza)
Simona Panni , University of Calabria, Rende (Cosenza)
Simona E. Rombo , University of Calabria, Rende (Cosenza)
Comparing and querying the protein-protein interaction (PPI) networks of different organisms is important to infer knowledge about conservation across species. Known methods that perform these tasks operate symmetrically, i.e., they do not assign a distinct role to the input PPI networks. However, in most cases, the input networks are indeed distinguishable on the basis of how the corresponding organism is biologically well characterized. In this paper a new idea is developed, that is, to exploit differences in the characterization of organisms at hand in order to devise methods for comparing their PPI networks. We use the PPI network (called Master) of the best characterized organism as a fingerprint to guide the alignment process to the second input network (called Slave), so that generated results preferably retain the structural characteristics of the Master network. Technically, this is obtained by generating from the Master a finite automaton, called alignment model, which is then fed with (a linearization of) the Slave for the purpose of extracting, via the Viterbi algorithm, matching subgraphs. We propose an approach able to perform global alignment and network querying, and we apply it on PPI networks. We tested our method showing that the results it returns are biologically relevant.
Biological networks, asymmetric alignment, master-slave analysis, network querying, evolutive conservations.
Luigi Palopoli, Nicola Ferraro, Simona Panni, Simona E. Rombo, "Asymmetric Comparison and Querying of Biological Networks", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 8, no. , pp. 876-889, July/August 2011, doi:10.1109/TCBB.2011.29
101 ms
(Ver 3.3 (11022016))