The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters
Open accessAbstract
The availability of computerized knowledge on biochemical pathways in the KEGG database opens new opportunities for developing computational methods to characterize and understand higher level functions of complete genomes. Our approach is based on the concept of graphs; for example, the genome is a graph with genes as nodes and the pathway is another graph with gene products as nodes. We have developed a simple method for graph comparison to identify local similarities, termed correlated clusters, between two graphs, which allows gaps and mismatches of nodes and edges and is especially suitable for detecting biological features. The method was applied to a comparison of the complete genomes of 10 microorganisms and the KEGG metabolic pathways, which revealed, not surprisingly, a tendency for formation of correlated clusters called FRECs (functionally related enzyme clusters). However, this tendency varied considerably depending on the organism. The relative number of enzymes in FRECs was close to 50% for Bacillus subtilis and Escherichia coli, but was <10% for SYNECHOCYSTIS: and Saccharomyces cerevisiae. The FRECs collection is reorganized into a collection of ortholog group tables in KEGG, which represents conserved pathway motifs with the information about gene clusters in all the completely sequenced genomes.
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
The complete genome sequence of the gram-positive bacterium Bacillus subtilis.
Kunst, F., Ogasawara, N., Moszer, I., Albertini, A. M., Alloni, G., Azevedo, V., Bertero, M. G., Bessières, P., Bolotin, A., Borchert, S., et al. (1997) · Nature · doi:10.1038/36786 · Cited by 3,679
The complete genome sequence of the gastric pathogen Helicobacter pylori
Tomb, J.-F., White, O., Kerlavage, A. R., Clayton, R. A., Sutton, G. G., Fleischmann, R. D., Ketchum, K. A., Klenk, H. P., Gill, S., Dougherty, B. A., et al. (1997) · Nature · doi:10.1038/41483 · Cited by 3,529
Cited by
Toward understanding the origin and evolution of cellular organisms
Kanehisa, M. (2019) · Protein Science · doi:10.1002/pro.3715 · Cited by 5,509
Modeling cellular machinery through biological network comparison
Sharan, R., & Ideker, T. (2006) · Nature Biotechnology · doi:10.1038/nbt1196 · Cited by 559
PathBLAST: a tool for alignment of protein interaction networks
Kelley, B. P., Yuan, B., Lewitter, F., Sharan, R., Stockwell, B. R., & Ideker, T. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh411 · Cited by 420
Græmlin: General and robust alignment of multiple large interaction networks
Flannick, J., Novak, A., Srinivasan, B. S., McAdams, H. H., & Batzoglou, S. (2006) · Genome Research · doi:10.1101/gr.5235706 · Cited by 320
Metadata
- Authors
- Ogata, H.
- Venue
- Nucleic Acids Research
- Publisher
- Oxford University Press (OUP)
- Published
- 2000-10-15
- Volume
- 28
- Issue
- 20
- Pages
- 4021-4028
- ISSN
- 0305-1048 (ISSN-L)
- 1362-4962
- OpenAlex
- W2029230311
- Cited by
- 221
- References
- 2
- FWCI
- 2.93
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters. https://app.cochat.ai/papers/10.1093/nar/28.20.4021
- The paper
- Ogata, H. (2000). A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters. Nucleic Acids Research. https://doi.org/10.1093/nar/28.20.4021
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.