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

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

A Parsimony Approach to Biological Pathway Reconstruction/Inference for Genomes and Metagenomes

Open access
Ye, Yuzhen, Doak, Thomas G.·2009·PLoS Computational Biology

Abstract

A common biological pathway reconstruction approach -- as implemented by many automatic biological pathway services (such as the KAAS and RAST servers) and the functional annotation of metagenomic sequences -- starts with the identification of protein functions or families (e.g., KO families for the KEGG database and the FIG families for the SEED database) in the query sequences, followed by a direct mapping of the identified protein families onto pathways. Given a predicted patchwork of individual biochemical steps, some metric must be applied in deciding what pathways actually exist in the genome or metagenome represented by the sequences. Commonly, and straightforwardly, a complete biological pathway can be identified in a dataset if at least one of the steps associated with the pathway is found. We report, however, that this naïve mapping approach leads to an inflated estimate of biological pathways, and thus overestimates the functional diversity of the sample from which the DNA sequences are derived. We developed a parsimony approach, called MinPath (Minimal set of Pathways), for biological pathway reconstructions using protein family predictions, which yields a more conservative, yet more faithful, estimation of the biological pathways for a query dataset. MinPath identified far fewer pathways for the genomes collected in the KEGG database -- as compared to the naïve mapping approach -- eliminating some obviously spurious pathway annotations. Results from applying MinPath to several metagenomes indicate that the common methods used for metagenome annotation may significantly overestimate the biological pathways encoded by microbial communities.

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.1371/journal.pcbi.1000465

Cites

24 of 24 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 24 references

Research works printed but not linked: 6

  1. Y Ye, 2005, Automatic detection of subsystem/pathway variants in genome analysis., Bioinformatics, 21, i478, 10.1093/bioinformatics/bti1052 · doi:10.1093/bioinformatics/bti1052
  2. I Friedberg, 2006, New avenues in protein function prediction., Protein Sci, 15, 1527, 10.1110/ps.062158406 · doi:10.1110/ps.062158406
  3. Y Hongoh, 2008, Genome of an endosymbiont coupling N2 fixation to cellulolysis within protist cells in termite gut., Science, 322, 1108, 10.1126/science.1165578 · doi:10.1126/science.1165578
  4. M Galperin, 2004, Metagenomics: from acid mine to shining sea., Environ Microbiol, 6, 543, 10.1111/j.1462-2920.2004.00652.x · doi:10.1111/j.1462-2920.2004.00652.x
  5. FM Rosin, 2005, Moonlighting vacuolar protease: multiple jobs for a busy protein., Trends Plant Sci, 10, 516, 10.1016/j.tplants.2005.09.002 · doi:10.1016/j.tplants.2005.09.002
  6. GW Klau, 2004, Optimal robust non-unique probe selection using Integer Linear Programming., Bioinformatics, 20, i186, 10.1093/bioinformatics/bth936 · doi:10.1093/bioinformatics/bth936

Cited by

See all 686

Metadata

Authors
Ye, Y., & Doak, T. G.
Venue
PLoS Computational Biology
Published
2009-08-14
Volume
5
Issue
8
Pages
e1000465
ISSN
  • 1553-734X (ISSN-L)
  • 1553-7358
OpenAlex
W2077631777
Cited by
686
References
24
FWCI
3.12
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: A Parsimony Approach to Biological Pathway Reconstruction/Inference for Genomes and Metagenomes. https://app.cochat.ai/papers/10.1371/journal.pcbi.1000465
The paper
Ye, Y., & Doak, T. G. (2009). A Parsimony Approach to Biological Pathway Reconstruction/Inference for Genomes and Metagenomes. PLoS Computational Biology. https://doi.org/10.1371/journal.pcbi.1000465

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.