Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 216

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

LGL: Creating a Map of Protein Function with an Algorithm for Visualizing Very Large Biological Networks

Adai, Alex T., Date, Shailesh V., Wieland, Shannon, Marcotte, Edward M. · 2004 · Journal of Molecular Biology

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.jmb.2004.04.047

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 5 references

Research works printed but not linked: 37

  1. Landers, 2001, Initial sequencing and analysis of the human genome, Nature, 409, 860, 10.1038/35057062 · DOI · Paper page
  2. Xenarios, 2001, DIP: the database of interacting proteins: 2001 update, Nucl. Acids Res., 29, 239, 10.1093/nar/29.1.239 · DOI · Paper page
  3. Ho, 2002, Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry, Nature, 415, 180, 10.1038/415180a · DOI · Paper page
  4. Sirava, 2002, BioMiner—modeling, analyzing, and visualizing biochemical pathways and networks, Bioinformatics, 18, S219, 10.1093/bioinformatics/18.suppl_2.S219 · doi:10.1093/bioinformatics/18.suppl_2.s219
  5. Kuffner, 2000, Pathway analysis in metabolic databases via differential metabolic display (DMD), Bioinformatics, 16, 825, 10.1093/bioinformatics/16.9.825 · DOI
  6. Goesmann, 2002, PathFinder: reconstruction and dynamic visualization of metabolic pathways, Bioinformatics, 18, 124, 10.1093/bioinformatics/18.1.124 · doi:10.1093/bioinformatics/18.1.124
  7. Batagelj, 1998, Pajek: a program for large network analysis, Connections, 21, 47
  8. Enright, 2001, BioLayout—an automatic graph layout algorithm for similarity visualization, Bioinformatics, 17, 853, 10.1093/bioinformatics/17.9.853 · DOI
  9. Ju, 2003, Visualization and analysis of protein interactions, Bioinformatics, 19, 317, 10.1093/bioinformatics/19.2.317 · doi:10.1093/bioinformatics/19.2.317
  10. Chervitz, 1998, Comparison of the complete protein sets of worm and yeast: orthology and divergence, Science, 282, 2022, 10.1126/science.282.5396.2022 · DOI · Paper page
  11. Altschul, 1997, Gapped BLAST and PSI-BLAST: a new generation of protein database search programs, Nucl. Acids Res., 25, 3389, 10.1093/nar/25.17.3389 · DOI · Paper page
  12. Bateman, 2002, The Pfam protein families database, Nucl. Acids Res., 30, 276, 10.1093/nar/30.1.276 · DOI · Paper page
  13. Apweiler, 2001, The InterPro database, an integrated documentation resource for protein families, domains and functional sites, Nucl. Acids Res., 29, 37, 10.1093/nar/29.1.37 · DOI · Paper page
  14. Tatusov, 1997, A genomic perspective on protein families, Science, 278, 631, 10.1126/science.278.5338.631 · DOI · Paper page
  15. Yona, 1999, ProtoMap: automatic classification of protein sequences, a hierarchy of protein families, and local maps of the protein space, Proteins: Struct. Funct. Genet., 37, 360, 10.1002/(SICI)1097-0134(19991115)37:3<360::AID-PROT5>3.0.CO;2-Z · doi:10.1002/(sici)1097-0134(19991115)37:3<360::aid-prot5>3.0.co;2-z
  16. Enright, 2002, An efficient algorithm for large-scale detection of protein families, Nucl. Acids Res., 30, 1575, 10.1093/nar/30.7.1575 · DOI · Paper page
  17. Enright, 1999, Protein interaction maps for complete genomes based on gene fusion events, Nature, 402, 86, 10.1038/47056 · DOI · Paper page
  18. Snel, 2000, Genome evolution. Gene fusion versus gene fission, Trends Genet., 16, 9, 10.1016/S0168-9525(99)01924-1 · DOI · Paper page
  19. Yanai, 2001, Genes linked by fusion events are generally of the same functional category: a systematic analysis of 30 microbial genomes, Proc. Natl Acad. Sci. USA, 98, 7940, 10.1073/pnas.141236298 · DOI · Paper page
  20. von Mering, 2003, STRING: a database of predicted functional associations between proteins, Nucl. Acids Res., 31, 258, 10.1093/nar/gkg034 · DOI · Paper page
  21. Yona, 2000, Towards a complete map of the protein space based on a unified sequence and structure analysis of all known proteins, Proc. Int. Conf. Intell. Syst. Mol. Biol., 8, 395
  22. Yona, 1998, A map of the protein space—an automatic hierarchical classification of all protein sequences, Proc. Int. Conf. Intell. Syst. Mol. Biol., 6, 212
  23. Linial, 1997, Global self-organization of all known protein sequences reveals inherent biological signatures, J. Mol. Biol., 268, 539, 10.1006/jmbi.1997.0948 · DOI
  24. Farnum, 2003, Exploring the nonlinear geometry of protein homology, Protein Sci., 12, 1604, 10.1110/ps.0379403 · doi:10.1110/ps.0379403
  25. Cheswick, B., Burch, H. & Branigan, S. (2000). Mapping and visualizing the internet. Proc. Usenix Annual Technical Conference, June 18–23, San Diego, CA.
  26. Enright, 2000, GeneRAGE: a robust algorithm for sequence clustering and domain detection, Bioinformatics, 16, 451, 10.1093/bioinformatics/16.5.451 · DOI · Paper page
  27. Abascal, 2002, Clustering of proximal sequence space for the identification of protein families, Bioinformatics, 18, 908, 10.1093/bioinformatics/18.7.908 · DOI
  28. Sharan, 2000, CLICK: a clustering algorithm with applications to gene expression analysis, Proc. Int. Conf. Intell. Syst. Mol. Biol., 8, 307
  29. Fischer, 1999, Finding families for genomic ORFans, Bioinformatics, 15, 759, 10.1093/bioinformatics/15.9.759 · DOI · Paper page
  30. Kanehisa, 2000, KEGG: Kyoto encyclopedia of genes and genomes, Nucl. Acids Res., 28, 27, 10.1093/nar/28.1.27 · DOI · Paper page
  31. Tatusov, 2001, The COG database: new developments in phylogenetic classification of proteins from complete genomes, Nucl. Acids Res., 29, 22, 10.1093/nar/29.1.22 · DOI · Paper page
  32. Hecht, 1995, Identification of a novel response regulator required for the swarmer-to-stalked-cell transition in Caulobacter crescentus, J. Bacteriol., 177, 6223, 10.1128/jb.177.21.6223-6229.1995 · DOI · Paper page
  33. Tal, 1998, Three cdg operons control cellular turnover of cyclic di-GMP in Acetobacter xylinum: genetic organization and occurrence of conserved domains in isoenzymes, J. Bacteriol., 180, 4416, 10.1128/JB.180.17.4416-4425.1998 · DOI · Paper page
  34. Schultz, 1998, SMART, a simple modular architecture research tool: identification of signaling domains, Proc. Natl Acad. Sci. USA, 95, 5857, 10.1073/pnas.95.11.5857 · DOI · Paper page
  35. Bairoch, 2000, The SWISS-PROT protein sequence database and its supplement TrEMBL in 2000, Nucl. Acids Res., 28, 45, 10.1093/nar/28.1.45 · DOI · Paper page
  36. Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Society, 7, 48–50. 1956. · DOI · Paper page
  37. Han, 2003, A fast layout algorithm for protein interaction networks, Bioinformatics, 19, 1882, 10.1093/bioinformatics/btg346 · doi:10.1093/bioinformatics/btg346

Cited by

See all 216

Metadata

Authors
Adai, A. T., Date, S. V., Wieland, S., & Marcotte, E. M.
Venue
Journal of Molecular Biology
Publisher
Elsevier BV
Published
2004-06
Volume
340
Issue
1
Pages
179-190
ISSN
0022-2836 (ISSN-L)
OpenAlex
W2115043726
Cited by
216
References
5
FWCI
3.17
Type
journal article
Language
en
Open access
closed
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)

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: LGL: Creating a Map of Protein Function with an Algorithm for Visualizing Very Large Biological Networks. https://app.cochat.ai/papers/10.1016/j.jmb.2004.04.047
The paper
Adai, A. T., Date, S. V., Wieland, S., & Marcotte, E. M. (2004). LGL: Creating a Map of Protein Function with an Algorithm for Visualizing Very Large Biological Networks. Journal of Molecular Biology. https://doi.org/10.1016/j.jmb.2004.04.047

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.