Michele Leone
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Michele Leone has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Andrea Pagnani
Politecnico di Torino
1 shared publication - Fabio Lucio Toninelli
Eurandom Technische Universiteit Eindhoven P.O. Box 513 5600 MB Eindhoven The Netherlands
1 shared publication - Silvio Franz
Università del Salento
1 shared publication
Latest Publications
- Open Access
- 17 September 2004
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (2) , 239-247
Predicting protein functions with message passing algorithms
Motivation: In the last few years, a growing interest in biology has been shifting toward the problem of optimal information extraction from the huge amount of data generated via large-scale and high-throughput techniques. One of the most relevant issues has recently emerged that of correctly and reliably predicting the functions of a given protein with that of functions exploiting information coming from the whole network of proteins physically interacting with the functionally undetermined one. In the present work, we will refer to an ‘observed’ protein as the one present in the protein–protein interaction networks published in the literature. Methods: The method proposed in this paper is based on a message passing algorithm known as Belief Propagation, which accepts the network of protein's physical interactions and a catalog of known protein's functions as input, and returns the probabilities for each unclassified protein of having one chosen function. The implementation of the algorithm allows for fast online analysis, and can easily be generalized into more complex graph topologies taking into account hypergraphs, i.e. complexes of more than two interacting proteins. Results: Benchmarks of our method are the two Saccharomyces cerevisiae protein–protein interaction networks and the Database of Interacting Proteins. The validity of our approach is successfully tested against other available techniques. Contact:leone@isiosf.isi.it Supplementary information:http://isiosf.isi.it/~pagnani
- 17 September 2004
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (2) , 239-247
Open AccessPredicting protein functions with message passing algorithms
Motivation: In the last few years, a growing interest in biology has been shifting toward the problem of optimal information extraction from the huge amount of data generated via large-scale and high-throughput techniques. One of the most relevant issues has recently emerged that of correctly and reliably predicting the functions of a given protein with that of functions exploiting information coming from the whole network of proteins physically interacting with the functionally undetermined one. In the present work, we will refer to an ‘observed’ protein as the one present in the protein–protein interaction networks published in the literature. Methods: The method proposed in this paper is based on a message passing algorithm known as Belief Propagation, which accepts the network of protein's physical interactions and a catalog of known protein's functions as input, and returns the probabilities for each unclassified protein of having one chosen function. The implementation of the algorithm allows for fast online analysis, and can easily be generalized into more complex graph topologies taking into account hypergraphs, i.e. complexes of more than two interacting proteins. Results: Benchmarks of our method are the two Saccharomyces cerevisiae protein–protein interaction networks and the Database of Interacting Proteins. The validity of our approach is successfully tested against other available techniques. Contact:leone@isiosf.isi.it Supplementary information:http://isiosf.isi.it/~pagnani
- Open Access
Replica bounds for diluted non-Poissonian spin systems
In this paper we extend replica bounds and free energy subadditivity arguments to diluted spin-glass models on graphs with arbitrary, non-Poissonian degree distribution. The new difficulties specific of this case are overcome introducing an interpolation procedure that stresses the relation between interpolation methods and the cavity method. As a byproduct we obtain self-averaging identities that generalize the Ghirlanda-Guerra ones to the multi-overlap case.
Open AccessReplica bounds for diluted non-Poissonian spin systems
In this paper we extend replica bounds and free energy subadditivity arguments to diluted spin-glass models on graphs with arbitrary, non-Poissonian degree distribution. The new difficulties specific of this case are overcome introducing an interpolation procedure that stresses the relation between interpolation methods and the cavity method. As a byproduct we obtain self-averaging identities that generalize the Ghirlanda-Guerra ones to the multi-overlap case.