Cargando…

Optimal Network Alignment with Graphlet Degree Vectors

Important biological information is encoded in the topology of biological networks. Comparative analyses of biological networks are proving to be valuable, as they can lead to transfer of knowledge between species and give deeper insights into biological function, disease, and evolution. We introduc...

Descripción completa

Detalles Bibliográficos
Autores principales: Milenković, Tijana, Ng, Weng Leong, Hayes, Wayne, Pržulj, Nataša
Formato: Texto
Lenguaje:English
Publicado: Libertas Academica 2010
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2901631/
https://www.ncbi.nlm.nih.gov/pubmed/20628593
_version_ 1782183705980174336
author Milenković, Tijana
Ng, Weng Leong
Hayes, Wayne
Pržulj, Nataša
author_facet Milenković, Tijana
Ng, Weng Leong
Hayes, Wayne
Pržulj, Nataša
author_sort Milenković, Tijana
collection PubMed
description Important biological information is encoded in the topology of biological networks. Comparative analyses of biological networks are proving to be valuable, as they can lead to transfer of knowledge between species and give deeper insights into biological function, disease, and evolution. We introduce a new method that uses the Hungarian algorithm to produce optimal global alignment between two networks using any cost function. We design a cost function based solely on network topology and use it in our network alignment. Our method can be applied to any two networks, not just biological ones, since it is based only on network topology. We use our new method to align protein-protein interaction networks of two eukaryotic species and demonstrate that our alignment exposes large and topologically complex regions of network similarity. At the same time, our alignment is biologically valid, since many of the aligned protein pairs perform the same biological function. From the alignment, we predict function of yet unannotated proteins, many of which we validate in the literature. Also, we apply our method to find topological similarities between metabolic networks of different species and build phylogenetic trees based on our network alignment score. The phylogenetic trees obtained in this way bear a striking resemblance to the ones obtained by sequence alignments. Our method detects topologically similar regions in large networks that are statistically significant. It does this independent of protein sequence or any other information external to network topology.
format Text
id pubmed-2901631
institution National Center for Biotechnology Information
language English
publishDate 2010
publisher Libertas Academica
record_format MEDLINE/PubMed
spelling pubmed-29016312010-07-13 Optimal Network Alignment with Graphlet Degree Vectors Milenković, Tijana Ng, Weng Leong Hayes, Wayne Pržulj, Nataša Cancer Inform Original Research Important biological information is encoded in the topology of biological networks. Comparative analyses of biological networks are proving to be valuable, as they can lead to transfer of knowledge between species and give deeper insights into biological function, disease, and evolution. We introduce a new method that uses the Hungarian algorithm to produce optimal global alignment between two networks using any cost function. We design a cost function based solely on network topology and use it in our network alignment. Our method can be applied to any two networks, not just biological ones, since it is based only on network topology. We use our new method to align protein-protein interaction networks of two eukaryotic species and demonstrate that our alignment exposes large and topologically complex regions of network similarity. At the same time, our alignment is biologically valid, since many of the aligned protein pairs perform the same biological function. From the alignment, we predict function of yet unannotated proteins, many of which we validate in the literature. Also, we apply our method to find topological similarities between metabolic networks of different species and build phylogenetic trees based on our network alignment score. The phylogenetic trees obtained in this way bear a striking resemblance to the ones obtained by sequence alignments. Our method detects topologically similar regions in large networks that are statistically significant. It does this independent of protein sequence or any other information external to network topology. Libertas Academica 2010-06-30 /pmc/articles/PMC2901631/ /pubmed/20628593 Text en © 2010 the author(s), publisher and licensee Libertas Academica Ltd. This is an open access article. Unrestricted non-commercial use is permitted provided the original work is properly cited.
spellingShingle Original Research
Milenković, Tijana
Ng, Weng Leong
Hayes, Wayne
Pržulj, Nataša
Optimal Network Alignment with Graphlet Degree Vectors
title Optimal Network Alignment with Graphlet Degree Vectors
title_full Optimal Network Alignment with Graphlet Degree Vectors
title_fullStr Optimal Network Alignment with Graphlet Degree Vectors
title_full_unstemmed Optimal Network Alignment with Graphlet Degree Vectors
title_short Optimal Network Alignment with Graphlet Degree Vectors
title_sort optimal network alignment with graphlet degree vectors
topic Original Research
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2901631/
https://www.ncbi.nlm.nih.gov/pubmed/20628593
work_keys_str_mv AT milenkovictijana optimalnetworkalignmentwithgraphletdegreevectors
AT ngwengleong optimalnetworkalignmentwithgraphletdegreevectors
AT hayeswayne optimalnetworkalignmentwithgraphletdegreevectors
AT przuljnatasa optimalnetworkalignmentwithgraphletdegreevectors