ArticleBMC systems biology2013
Identifying protein complexes based on density and modularity in protein-protein interaction network.
Article in BMC systems biology, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 12 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
12 citing papers in PubMed.
- Computational insights into cancer stem cell dynamics and the urokinase plasminogen activation pathway.Journal of biosciences · 2026Article
- Anticancer Secondary Metabolites: From Ethnopharmacology and Identification in Native Complexes to Biotechnological Studies in Species of GenusCurrent issues in molecular biology · 2022Article
- A virus-target host proteins recognition method based on integrated complexes data and seed extension.BMC bioinformatics · 2022Article
- Overview of methods for characterization and visualization of a protein-protein interaction network in a multi-omics integration context.Frontiers in molecular biosciences · 2022Review
- Identifying protein complexes based on an edge weight algorithm and core-attachment structure.BMC bioinformatics · 2019Article
- A seed-extended algorithm for detecting protein complexes based on density and modularity with topological structure and GO annotations.BMC genomics · 2019Article
- Concurrence of form and function in developing networks and its role in synaptic pruning.Nature communications · 2018Article
- Construction of dynamic probabilistic protein interaction networks for protein complex identification.BMC bioinformatics · 2016Article
- Clustering PPI data by combining FA and SHC method.BMC genomics · 2015Article
- Detecting overlapping protein complexes based on a generative model with functional and topological properties.BMC bioinformatics · 2014Article
- Identifying hierarchical and overlapping protein complexes based on essential protein-protein interactions and "seed-expanding" method.BioMed research international · 2014Article
- ABC and IFC: modules detection method for PPI network.BioMed research international · 2014Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
backgroundIdentifying protein complexes is crucial to understanding principles of cellular organization and functional mechanisms. As many evidences have indicated that the subgraphs with high density or with high modularity in PPI network usually correspond to protein complexes, protein complexes detection methods based on PPI network focused on subgraph's density or its modularity in PPI network. However, dense subgraphs may have low modularity and subgraph with high modularity may have low density, which results that protein complexes may be subgraphs with low modularity or with low density in the PPI network. As the density-based methods are difficult to mine protein complexes with low density, and the modularity-based methods are difficult to mine protein complexes with low modularity, both two methods have limitation for identifying protein complexes with various density and modularity.
resultsTo identify protein complexes with various density and modularity, including those have low density but high modularity and those have low modularity but high density, we define a novel subgraph's fitness, fρ, as fρ= (density)(ρ*)(modularity)(1-ρ), and propose a novel algorithm, named LF_PIN, to identify protein complexes by expanding seed edges to subgraphs with the local maximum fitness value. Experimental results of LF-PIN in S.cerevisiae show that compared with the results of fitness equal to density (ρ = 1) or equal to modularity (ρ = 0), the LF-PIN identifies known protein complexes more effectively when the fitness value is decided by both density and modularity (0<ρ<1). Compared with the results of seven competing protein complex detection methods (CMC, Core-Attachment, CPM, DPClus, HC-PIN, MCL, and NFC) in S.cerevisiae and E.coli, LF-PIN outperforms other seven methods in terms of matching with known complexes and functional enrichment. Moreover, LF-PIN has better performance in identifying protein complexes with low density or with low modularity.
conclusionsBy considering both the density and the modularity, LF-PIN outperforms other protein complexes detection methods that only consider density or modularity, especially in identifying known protein complexes with low density or low modularity.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.