The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
Open accessAbstract
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set increases, a general trend is to represent the interactions as a network and to develop effective algorithms to detect significant complexes in such networks. Results: Based on the study of known complexes in protein networks, this paper proposes a new topological structure for protein complexes, which is a combination of subgraph diameter (or average vertex distance) and subgraph density. Following the approach of that of the previously proposed clustering algorithm DPClus which expands clusters starting from seeded vertices, we present a clustering algorithm IPCA based on the new topological structure for identifying complexes in large protein interaction networks. The algorithm IPCA is applied to the protein interaction network of Sacchromyces cerevisiae and identifies many well known complexes. Experimental results show that the algorithm IPCA recalls more known complexes than previously proposed clustering algorithms, including DPClus, CFinder, LCMA, MCODE, RNSC and STM. Conclusion: The proposed algorithm based on the new topological structure makes it possible to identify dense subgraphs in protein interaction networks, many of which correspond to known protein complexes. The algorithm is robust to the known high rate of false positives and false negatives in data from high-throughout interaction techniques. The program is available at http://netlab.csu.edu.cn/bioinformatics/limin/IPCA.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
Cited by
CytoNCA: A cytoscape plugin for centrality analysis and evaluation of protein interaction networks
Tang, Y., Li, M., Wang, J., Pan, Y., & Wu, F.-X. (2015) · Biosystems · doi:10.1016/j.biosystems.2014.11.005 · Cited by 1,288
Self-citationComplex discovery from weighted PPI networks
Liu, G., Wong, L., & Chua, H. N. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp311 · Cited by 470
Learning from Co-expression Networks: Possibilities and Challenges
Serin, E. A. R., Nijveen, H., Hilhorst, H. W. M., & Ligterink, W. (2016) · Frontiers in Plant Science · doi:10.3389/fpls.2016.00444 · Cited by 304
Thermal proximity coaggregation for system-wide profiling of protein complex dynamics in cells
Tan, C. S. H., Go, K. D., Bisteau, X., Dai, L., Yong, C. H., Prabhu, N., Ozturk, M. B., Lim, Y. T., Sreekumar, L., Lengqvist, J., et al. (2018) · Science · doi:10.1126/science.aan0346 · Cited by 224
Yao, H., Guan, J., & Liu, T. (2020) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s0219720020400107 · Cited by 23
Metadata
- Authors
- Li, M., Chen, J.-E., Wang, J.-X., Hu, B., & Chen, G.
- Venue
- BMC Bioinformatics
- Published
- 2008-09-25
- Volume
- 9
- Issue
- 1
- Pages
- 398-398
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2090422756
- Cited by
- 246
- References
- 1
- FWCI
- 3.10
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. https://app.cochat.ai/papers/10.1186/1471-2105-9-398
- The paper
- Li, M., Chen, J.-E., Wang, J.-X., Hu, B., & Chen, G. (2008). Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-9-398
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.