Cargando…
Topological and functional comparison of community detection algorithms in biological networks
BACKGROUND: Community detection algorithms are fundamental tools to uncover important features in networks. There are several studies focused on social networks but only a few deal with biological networks. Directly or indirectly, most of the methods maximize modularity, a measure of the density of...
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/PMC6487005/ https://www.ncbi.nlm.nih.gov/pubmed/31029085 http://dx.doi.org/10.1186/s12859-019-2746-0 |
_version_ | 1783414419400687616 |
---|---|
author | Rahiminejad, Sara Maurya, Mano R. Subramaniam, Shankar |
author_facet | Rahiminejad, Sara Maurya, Mano R. Subramaniam, Shankar |
author_sort | Rahiminejad, Sara |
collection | PubMed |
description | BACKGROUND: Community detection algorithms are fundamental tools to uncover important features in networks. There are several studies focused on social networks but only a few deal with biological networks. Directly or indirectly, most of the methods maximize modularity, a measure of the density of links within communities as compared to links between communities. RESULTS: Here we analyze six different community detection algorithms, namely, Combo, Conclude, Fast Greedy, Leading Eigen, Louvain and Spinglass, on two important biological networks to find their communities and evaluate the results in terms of topological and functional features through Kyoto Encyclopedia of Genes and Genomes pathway and Gene Ontology term enrichment analysis. At a high level, the main assessment criteria are 1) appropriate community size (neither too small nor too large), 2) representation within the community of only one or two broad biological functions, 3) most genes from the network belonging to a pathway should also belong to only one or two communities, and 4) performance speed. The first network in this study is a network of Protein-Protein Interactions (PPI) in Saccharomyces cerevisiae (Yeast) with 6532 nodes and 229,696 edges and the second is a network of PPI in Homo sapiens (Human) with 20,644 nodes and 241,008 edges. All six methods perform well, i.e., find reasonably sized and biologically interpretable communities, for the Yeast PPI network but the Conclude method does not find reasonably sized communities for the Human PPI network. Louvain method maximizes modularity by using an agglomerative approach, and is the fastest method for community detection. For the Yeast PPI network, the results of Spinglass method are most similar to the results of Louvain method with regard to the size of communities and core pathways they identify, whereas for the Human PPI network, Combo and Spinglass methods yield the most similar results, with Louvain being the next closest. CONCLUSIONS: For Yeast and Human PPI networks, Louvain method is likely the best method to find communities in terms of detecting known core pathways in a reasonable time. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (10.1186/s12859-019-2746-0) contains supplementary material, which is available to authorized users. |
format | Online Article Text |
id | pubmed-6487005 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2019 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-64870052019-05-06 Topological and functional comparison of community detection algorithms in biological networks Rahiminejad, Sara Maurya, Mano R. Subramaniam, Shankar BMC Bioinformatics Research Article BACKGROUND: Community detection algorithms are fundamental tools to uncover important features in networks. There are several studies focused on social networks but only a few deal with biological networks. Directly or indirectly, most of the methods maximize modularity, a measure of the density of links within communities as compared to links between communities. RESULTS: Here we analyze six different community detection algorithms, namely, Combo, Conclude, Fast Greedy, Leading Eigen, Louvain and Spinglass, on two important biological networks to find their communities and evaluate the results in terms of topological and functional features through Kyoto Encyclopedia of Genes and Genomes pathway and Gene Ontology term enrichment analysis. At a high level, the main assessment criteria are 1) appropriate community size (neither too small nor too large), 2) representation within the community of only one or two broad biological functions, 3) most genes from the network belonging to a pathway should also belong to only one or two communities, and 4) performance speed. The first network in this study is a network of Protein-Protein Interactions (PPI) in Saccharomyces cerevisiae (Yeast) with 6532 nodes and 229,696 edges and the second is a network of PPI in Homo sapiens (Human) with 20,644 nodes and 241,008 edges. All six methods perform well, i.e., find reasonably sized and biologically interpretable communities, for the Yeast PPI network but the Conclude method does not find reasonably sized communities for the Human PPI network. Louvain method maximizes modularity by using an agglomerative approach, and is the fastest method for community detection. For the Yeast PPI network, the results of Spinglass method are most similar to the results of Louvain method with regard to the size of communities and core pathways they identify, whereas for the Human PPI network, Combo and Spinglass methods yield the most similar results, with Louvain being the next closest. CONCLUSIONS: For Yeast and Human PPI networks, Louvain method is likely the best method to find communities in terms of detecting known core pathways in a reasonable time. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (10.1186/s12859-019-2746-0) contains supplementary material, which is available to authorized users. BioMed Central 2019-04-27 /pmc/articles/PMC6487005/ /pubmed/31029085 http://dx.doi.org/10.1186/s12859-019-2746-0 Text en © The Author(s). 2019 Open AccessThis 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 Article Rahiminejad, Sara Maurya, Mano R. Subramaniam, Shankar Topological and functional comparison of community detection algorithms in biological networks |
title | Topological and functional comparison of community detection algorithms in biological networks |
title_full | Topological and functional comparison of community detection algorithms in biological networks |
title_fullStr | Topological and functional comparison of community detection algorithms in biological networks |
title_full_unstemmed | Topological and functional comparison of community detection algorithms in biological networks |
title_short | Topological and functional comparison of community detection algorithms in biological networks |
title_sort | topological and functional comparison of community detection algorithms in biological networks |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6487005/ https://www.ncbi.nlm.nih.gov/pubmed/31029085 http://dx.doi.org/10.1186/s12859-019-2746-0 |
work_keys_str_mv | AT rahiminejadsara topologicalandfunctionalcomparisonofcommunitydetectionalgorithmsinbiologicalnetworks AT mauryamanor topologicalandfunctionalcomparisonofcommunitydetectionalgorithmsinbiologicalnetworks AT subramaniamshankar topologicalandfunctionalcomparisonofcommunitydetectionalgorithmsinbiologicalnetworks |