Cargando…
A novel algorithm for alignment of multiple PPI networks based on simulated annealing
Proteins play essential roles in almost all life processes. The prediction of protein function is of significance for the understanding of molecular function and evolution. Network alignment provides a fast and effective framework to automatically identify functionally conserved proteins in a system...
Autores principales: | , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6933650/ https://www.ncbi.nlm.nih.gov/pubmed/31881842 http://dx.doi.org/10.1186/s12864-019-6302-0 |
_version_ | 1783483249942593536 |
---|---|
author | Hu, Jialu He, Junhao Li, Jing Gao, Yiqun Zheng, Yan Shang, Xuequn |
author_facet | Hu, Jialu He, Junhao Li, Jing Gao, Yiqun Zheng, Yan Shang, Xuequn |
author_sort | Hu, Jialu |
collection | PubMed |
description | Proteins play essential roles in almost all life processes. The prediction of protein function is of significance for the understanding of molecular function and evolution. Network alignment provides a fast and effective framework to automatically identify functionally conserved proteins in a systematic way. However, due to the fast growing genomic data, interactions and annotation data, there is an increasing demand for more accurate and efficient tools to deal with multiple PPI networks. Here, we present a novel global alignment algorithm NetCoffee2 based on graph feature vectors to discover functionally conserved proteins and predict function for unknown proteins. To test the algorithm performance, NetCoffee2 and three other notable algorithms were applied on eight real biological datasets. Functional analyses were performed to evaluate the biological quality of these alignments. Results show that NetCoffee2 is superior to existing algorithms IsoRankN, NetCoffee and multiMAGNA++ in terms of both coverage and consistency. The binary and source code are freely available under the GNU GPL v3 license at https://github.com/screamer/NetCoffee2. |
format | Online Article Text |
id | pubmed-6933650 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2019 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-69336502019-12-30 A novel algorithm for alignment of multiple PPI networks based on simulated annealing Hu, Jialu He, Junhao Li, Jing Gao, Yiqun Zheng, Yan Shang, Xuequn BMC Genomics Research Proteins play essential roles in almost all life processes. The prediction of protein function is of significance for the understanding of molecular function and evolution. Network alignment provides a fast and effective framework to automatically identify functionally conserved proteins in a systematic way. However, due to the fast growing genomic data, interactions and annotation data, there is an increasing demand for more accurate and efficient tools to deal with multiple PPI networks. Here, we present a novel global alignment algorithm NetCoffee2 based on graph feature vectors to discover functionally conserved proteins and predict function for unknown proteins. To test the algorithm performance, NetCoffee2 and three other notable algorithms were applied on eight real biological datasets. Functional analyses were performed to evaluate the biological quality of these alignments. Results show that NetCoffee2 is superior to existing algorithms IsoRankN, NetCoffee and multiMAGNA++ in terms of both coverage and consistency. The binary and source code are freely available under the GNU GPL v3 license at https://github.com/screamer/NetCoffee2. BioMed Central 2019-12-27 /pmc/articles/PMC6933650/ /pubmed/31881842 http://dx.doi.org/10.1186/s12864-019-6302-0 Text en © The Author(s) 2019 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver(http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. |
spellingShingle | Research Hu, Jialu He, Junhao Li, Jing Gao, Yiqun Zheng, Yan Shang, Xuequn A novel algorithm for alignment of multiple PPI networks based on simulated annealing |
title | A novel algorithm for alignment of multiple PPI networks based on simulated annealing |
title_full | A novel algorithm for alignment of multiple PPI networks based on simulated annealing |
title_fullStr | A novel algorithm for alignment of multiple PPI networks based on simulated annealing |
title_full_unstemmed | A novel algorithm for alignment of multiple PPI networks based on simulated annealing |
title_short | A novel algorithm for alignment of multiple PPI networks based on simulated annealing |
title_sort | novel algorithm for alignment of multiple ppi networks based on simulated annealing |
topic | Research |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6933650/ https://www.ncbi.nlm.nih.gov/pubmed/31881842 http://dx.doi.org/10.1186/s12864-019-6302-0 |
work_keys_str_mv | AT hujialu anovelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT hejunhao anovelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT lijing anovelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT gaoyiqun anovelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT zhengyan anovelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT shangxuequn anovelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT hujialu novelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT hejunhao novelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT lijing novelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT gaoyiqun novelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT zhengyan novelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing AT shangxuequn novelalgorithmforalignmentofmultipleppinetworksbasedonsimulatedannealing |