The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Detecting putative orthologs
Abstract
Summary: We developed an algorithm that improves upon the common procedure of taking reciprocal best blast hits (rbh) in the identification of orthologs. The method—reciprocal smallest distance algorithm (rsd)—relies on global sequence alignment and maximum likelihood estimation of evolutionary distances to detect orthologs between two genomes. rsd finds many putative orthologs missed by rbh because it is less likely than rbh to be misled by the presence of a close paralog. Availability: A Python program and ReadMe file are freely available from: http://charles.stanford.edu/~dennis/research.html
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
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
The rapid generation of mutation data matrices from protein sequences
Jones, D. T., Taylor, W. R., & Thornton, J. M. (1992) · Bioinformatics · doi:10.1093/bioinformatics/8.3.275 · Cited by 6,947
Essential Genes Are More Evolutionarily Conserved Than Are Nonessential Genes in Bacteria
Jordan, I. K., Rogozin, I. B., Wolf, Y. I., & Koonin, E. V. (2002) · Genome Research · doi:10.1101/gr.87702 · Cited by 552
The Closest BLAST Hit Is Often Not the Nearest Neighbor
Koski, L. B., & Golding, G. B. (2001) · Journal of Molecular Evolution · doi:10.1007/s002390010184 · Cited by 466
Protein dispensability and rate of evolution
Hirsh, A. E., & Fraser, H. B. (2001) · Nature · doi:10.1038/35082561 · Cited by 413
Self-citationNei, M., Xu, P., & Glazko, G. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.051611498 · Cited by 329
Thompson, J. D. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.15.2919 · Cited by 179
Cited by
Protein complex prediction with AlphaFold-Multimer
Evans, R., O’Neill, M., Pritzel, A., Antropova, N., Senior, A., Green, T., Žídek, A., Bates, R., Blackwell, S., Yim, J., et al. (2021) · doi:10.1101/2021.10.04.463034 · Cited by 3,808
Emms, D. M., & Kelly, S. (2015) · Genome Biology · doi:10.1186/s13059-015-0721-2 · Cited by 3,408
Genomic Analysis of the Necrotrophic Fungal Pathogens Sclerotinia sclerotiorum and Botrytis cinerea
Amselem, J., Cuomo, C. A., van Kan, J. A. L., Viaud, M., Benito, E. P., Couloux, A., Coutinho, P. M., de Vries, R. P., Dyer, P. S., Fillinger, S., et al. (2011) · PLoS Genetics · doi:10.1371/journal.pgen.1002230 · Cited by 1,040
Why highly expressed proteins evolve slowly
Drummond, D. A., Bloom, J. D., Adami, C., Wilke, C. O., & Arnold, F. H. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0504070102 · Cited by 815
A survey on addressing high-class imbalance in big data
Leevy, J. L., Khoshgoftaar, T. M., Bauder, R. A., & Seliya, N. (2018) · Journal of Big Data · doi:10.1186/s40537-018-0151-6 · Cited by 759
Metadata
- Authors
- Wall, D. P., Fraser, H. B., & Hirsh, A. E.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2003-09-01
- Volume
- 19
- Issue
- 13
- Pages
- 1710-1711
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2154044807
- Cited by
- 289
- References
- 7
- FWCI
- 4.18
- Type
- journal article
- Language
- en
- Open access
- closed
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.