The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Quickly Finding Orthologs as Reciprocal Best Hits with BLAT, LAST, and UBLAST: How Much Do We Miss?
Open accessAbstract
Reciprocal Best Hits (RBH) are a common proxy for orthology in comparative genomics. Essentially, a RBH is found when the proteins encoded by two genes, each in a different genome, find each other as the best scoring match in the other genome. NCBI's BLAST is the software most usually used for the sequence comparisons necessary to finding RBHs. Since sequence comparison can be time consuming, we decided to compare the number and quality of RBHs detected using algorithms that run in a fraction of the time as BLAST. We tested BLAT, LAST and UBLAST. All three programs ran in a hundredth to a 25th of the time required to run BLAST. A reduction in the number of homologs and RBHs found by the faster algorithms compared to BLAST becomes apparent as the genomes compared become more dissimilar, with BLAT, a program optimized for quickly finding very similar sequences, missing both the most homologs and the most RBHs. Though LAST produced the closest number of homologs and RBH to those produced with BLAST, UBLAST was very close, with either program producing between 0.6 and 0.8 of the RBHs as BLAST between dissimilar genomes, while in more similar genomes the differences were barely apparent. UBLAST ran faster than LAST, making it the best option among the programs tested.
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
BLAST+: architecture and applications
Camacho, C., Coulouris, G., Avagyan, V., Ma, N., Papadopoulos, J., Bealer, K., & Madden, T. L. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-421 · Cited by 22,074
<tt>BLAT</tt> —The <tt>BLAST</tt> -Like Alignment Tool
Kent, W. J. (2002) · Genome Research · doi:10.1101/gr.229202 · Cited by 8,480
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
EnsemblCompara GeneTrees: Complete, duplication-aware phylogenetic trees in vertebrates
Vilella, A. J., Severin, J., Ureta-Vidal, A., Heng, L., Durbin, R., & Birney, E. (2009) · Genome Research · doi:10.1101/gr.073585.107 · Cited by 1,238
Functional and evolutionary implications of gene orthology
Gabaldón, T., & Koonin, E. V. (2013) · Nature Reviews Genetics · doi:10.1038/nrg3456 · Cited by 643
Ruan, J., Li, H., Chen, Z., Coghlan, A., Coin, L. J. M., Guo, Y., Heriche, J.-K., Hu, Y., Kristiansen, K., Li, R., et al. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm1005 · Cited by 332
Cited by
Wang, Y., Coleman-Derr, D., Chen, G., & Gu, Y. Q. (2015) · Nucleic Acids Research · doi:10.1093/nar/gkv487 · Cited by 888
OrthoDB v8: update of the hierarchical catalog of orthologs and the underlying free software
Kriventseva, E. V., Tegenfeldt, F., Petty, T. J., Waterhouse, R. M., Simão, F. A., Pozdnyakov, I. A., Ioannidis, P., & Zdobnov, E. M. (2015) · Nucleic Acids Research · doi:10.1093/nar/gku1220 · Cited by 280
Reciprocal best structure hits: using AlphaFold models to discover distant homologues
Monzon, V., Paysan-Lafosse, T., Wood, V., & Bateman, A. (2022) · Bioinformatics Advances · doi:10.1093/bioadv/vbac072 · Cited by 46
Metadata
- Authors
- Ward, N., & Moreno-Hagelsieb, G.
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2014-07-11
- Volume
- 9
- Issue
- 7
- Pages
- e101850
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W1965372971
- Cited by
- 176
- References
- 6
- FWCI
- 4.99
- 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: Quickly Finding Orthologs as Reciprocal Best Hits with BLAT, LAST, and UBLAST: How Much Do We Miss? https://app.cochat.ai/papers/10.1371/journal.pone.0101850
- The paper
- Ward, N., & Moreno-Hagelsieb, G. (2014). Quickly Finding Orthologs as Reciprocal Best Hits with BLAT, LAST, and UBLAST: How Much Do We Miss? PLoS ONE. https://doi.org/10.1371/journal.pone.0101850
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.