The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
CFinder: locating cliques and overlapping modules in biological networks
Open accessAbstract
Summary: Most cellular tasks are performed not by individual proteins, but by groups of functionally associated proteins, often referred to as modules. In a protein assocation network modules appear as groups of densely interconnected nodes, also called communities or clusters. These modules often overlap with each other and form a network of their own, in which nodes (links) represent the modules (overlaps). We introduce CFinder, a fast program locating and visualizing overlapping, densely interconnected groups of nodes in undirected graphs, and allowing the user to easily navigate between the original graph and the web of these groups. We show that in gene (protein) association networks CFinder can be used to predict the function(s) of a single protein and to discover novel modules. CFinder is also very efficient for locating the cliques of large sparse graphs. Availability: CFinder (for Windows, Linux and Macintosh) and its manual can be downloaded from . Supplementary information: Supplementary data are available on Bioinformatics online. Contact: cfinder@angel.elte.hu
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cytoscape: A software Environment for integrated models of biomolecular interaction networks
Shannon, P., Markiel, A., Ozier, O., Baliga, N. S., Wang, J. T., Ramage, D., Amin, N., Schwikowski, B., & Ideker, T. (2003) · Genome Research · doi:10.1101/gr.1239303 · Cited by 51,888
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
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
Self-citationThe Database of Interacting Proteins: 2004 update
Salwinski, L. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh086 · Cited by 2,271
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
Detecting community structure in networks
Newman, M. E. J. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00124-y · Cited by 2,028
von Mering, C. (2004) · Nucleic Acids Research · doi:10.1093/nar/gki005 · Cited by 1,764
Pajek - Program for Large Network Analysis
Batagelj, V., & Mrvar, A. (1999) · Cited by 1,455
Modular organization of cellular networks
Rives, A. W., & Galitski, T. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0237338100 · Cited by 703
Clique Percolation in Random Networks
Derényi, I., Palla, G., & Vicsek, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.160202 · Cited by 558
Self-citationCYGD: the Comprehensive Yeast Genome Database
Guldener, U. (2004) · Nucleic Acids Research · doi:10.1093/nar/gki053 · Cited by 338
Discovery of uncharacterized cellular systems by genome-wide analysis of functional linkages
Date, S. V., & Marcotte, E. M. (2003) · Nature Biotechnology · doi:10.1038/nbt861 · Cited by 227
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Network‐based prediction of protein function
Sharan, R., Ulitsky, I., & Shamir, R. (2007) · Molecular Systems Biology · doi:10.1038/msb4100129 · Cited by 1,074
Structure and dynamics of molecular networks: A novel paradigm of drug discovery
Csermely, P., Korcsmáros, T., Kiss, H. J. M., London, G., & Nussinov, R. (2013) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2013.01.016 · Cited by 892
Finding overlapping communities in networks by label propagation
Gregory, S. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/10/103018 · Cited by 806
Getting connected: analysis and principles of biological networks
Zhu, X., Gerstein, M., & Snyder, M. (2007) · Genes & Development · doi:10.1101/gad.1528707 · Cited by 554
Metadata
- Authors
- Adamcsek, B., Palla, G., Farkas, I. J., Derényi, I., & Vicsek, T.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2006-02-10
- Volume
- 22
- Issue
- 8
- Pages
- 1021-1023
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2165533101
- Cited by
- 933
- References
- 12
- FWCI
- 9.33
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.