Multiple alignment of biological networks: A flexible approach

12Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recent experimental progress is once again producing a huge quantity of data in various areas of biology, in particular on protein interactions. In order to extract meaningful information from this data, researchers typically use a graph representation to which they apply network alignment tools. Because of the combinatorial difficulty of the network alignment problem, most of the algorithms developed so far are heuristics, and the exact ones are of no use in practice on large numbers of networks. In this paper, we propose a unified scheme on the question of network alignment and we present a new algorithm, C3Part-M, based on the work by Boyer et al. [2], that is much more efficient than the original one in the case of multiple networks. We compare it as concerns protein-protein interaction networks to a recently proposed alignment tool, NetworkBLAST-M [10], and show that we recover similar results, while using a different but exact approach. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Deniélou, Y. P., Boyer, F., Viari, A., & Sagot, M. F. (2009). Multiple alignment of biological networks: A flexible approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5577 LNCS, pp. 263–273). https://doi.org/10.1007/978-3-642-02441-2_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free