We here describe PRODISTIN, a new computational method allowing the functional
clustering of proteins on the basis of protein-protein interaction data. This method, assessed …

Motivation: Multifunctional proteins perform several functions. They are expected to interact
specifically with distinct sets of partners, simultaneously or not, depending on the function …

After recalling some facts about the median linear orders problem, two heuristics are studied
to solve it. Then, a branch and bound method is designed which computes all the solutions.

In this paper, we compare five classical distance indices on P n , the set of partitions on n
elements. First, we recall the definition of the transfer distance between partitions and an …

In this paper, we study a distance defined over the partitions of a finite set. Given two partitions
P and Q, this distance is defined as the minimum number of transfers of an element from …

Background Developing reliable and efficient strategies allowing to infer a function to yet
uncharacterized proteins based on interaction networks is of crucial interest in the current …

Divisive hierarchical clustering algorithms with the diameter criterion proceed by recursively
selecting the cluster with largest diameter and partitioning it into two clusters whose largest …

Given a profile (family) Π of partitions of a set of objects or items X, we try to establish a
consensus partition containing a maximum number of joined or separated pairs in X that are also …

Background and scope Large networks, such as protein interaction networks, are extremely
difficult to analyze as a whole. We developed Clust&See, a Cytoscape plugin dedicated to …

Identification of modules in molecular networks is at the core of many current analysis
methods in biomedical research. However, how well different approaches identify disease-…