The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Development and implementation of an algorithm for detection of protein complexes in large interaction networks
Open accessAbstract
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry etc. are producing huge data sets of protein-protein interactions which can be portrayed as networks, and one of the burning issues is to find protein complexes in such networks. The enormous size of protein-protein interaction (PPI) networks warrants development of efficient computational methods for extraction of significant complexes. Results: This paper presents an algorithm for detection of protein complexes in large interaction networks. In a PPI network, a node represents a protein and an edge represents an interaction. The input to the algorithm is the associated matrix of an interaction network and the outputs are protein complexes. The complexes are determined by way of finding clusters, i. e. the densely connected regions in the network. We also show and analyze some protein complexes generated by the proposed algorithm from typical PPI networks of Escherichia coli and Saccharomyces cerevisiae. A comparison between a PPI and a random network is also performed in the context of the proposed algorithm. Conclusion: The proposed algorithm makes it possible to detect clusters of proteins in PPI networks which mostly represent molecular biological functional units. Therefore, protein complexes determined solely based on interaction data can help us to predict the functions of proteins, and they are also useful to understand and explain certain biological processes.
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
An automated method for finding molecular complexes in large protein interaction networks
Bader, G. D., & Hogue, C. W. (2003) · BMC Bioinformatics · doi:10.1186/1471-2105-4-2 · Cited by 6,072
Lethality and centrality in protein networks
Jeong, H., Mason, S. P., Barabási, A.-L., & Oltvai, Z. N. (2001) · Nature · doi:10.1038/35075138 · Cited by 5,287
Functional organization of the yeast proteome by systematic analysis of protein complexes
Gavin, A.-C., Bösche, M., Krause, R., Grandi, P., Marzioch, M., Bauer, A., Schultz, J., Rick, J. M., Michon, A.-M., Cruciat, C.-M., et al. (2002) · Nature · doi:10.1038/415141a · Cited by 4,759
Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry
Ho, Y., Gruhler, A., Heilbut, A., Bader, G. D., Moore, L., Adams, S.-L., Millar, A., Taylor, P., Bennett, K., Boutilier, K., et al. (2002) · Nature · doi:10.1038/415180a · Cited by 3,601
Boyle, E. I., Weng, S., Gollub, J., Jin, H., Botstein, D., Cherry, J. M., & Sherlock, G. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth456 · Cited by 2,067
Network structure and minimum degree
Seidman, S. B. (1983) · Social Networks · doi:10.1016/0378-8733(83)90028-x · Cited by 1,891
Protein complexes and functional modules in molecular networks
Spirin, V., & Mirny, L. A. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2032324100 · Cited by 1,461
A network of protein–protein interactions in yeast
Schwikowski, B., Uetz, P., & Fields, S. (2000) · Nature Biotechnology · doi:10.1038/82360 · Cited by 1,363
Complex networks: Small-world, scale-free and beyond
Wang, X. F., & Chen, G. (2003) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2003.1228503 · Cited by 1,348
Protein complex prediction via cost-based clustering
King, A. D., Pržulj, N., & Jurisica, I. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth351 · Cited by 666
Cited by
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Network‐based prediction of protein function
Sharan, R., Ulitsky, I., & Shamir, R. (2007) · Molecular Systems Biology · doi:10.1038/msb4100129 · Cited by 1,074
Evaluation of clustering algorithms for protein-protein interaction networks
Brohée, S., & van Helden, J. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-488 · Cited by 892
Protein-to-protein interactions: Technologies, databases, and algorithms
Cannataro, M., Guzzi, P. H., & Veltri, P. (2010) · ACM Computing Surveys · doi:10.1145/1824795.1824796 · Cited by 620
Complex discovery from weighted PPI networks
Liu, G., Wong, L., & Chua, H. N. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp311 · Cited by 470
Metadata
- Authors
- Altaf-Ul-Amin, M., Shinbo, Y., Mihara, K., Kurokawa, K., & Kanaya, S.
- Venue
- BMC Bioinformatics
- Published
- 2006-04-14
- Volume
- 7
- Issue
- 1
- Pages
- 207-207
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W1485582261
- Cited by
- 495
- References
- 12
- FWCI
- 6.51
- 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: Development and implementation of an algorithm for detection of protein complexes in large interaction networks. https://app.cochat.ai/papers/10.1186/1471-2105-7-207
- The paper
- Altaf-Ul-Amin, M., Shinbo, Y., Mihara, K., Kurokawa, K., & Kanaya, S. (2006). Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-7-207
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.