The DOI matches its Crossref record.
Selecting the Right Similarity‐Scoring Matrix
Open accessAbstract
Protein sequence similarity searching programs like BLASTP, SSEARCH, and FASTA use scoring matrices that are designed to identify distant evolutionary relationships (BLOSUM62 for BLAST, BLOSUM50 for SSEARCH and FASTA). Different similarity scoring matrices are most effective at different evolutionary distances. “Deep” scoring matrices like BLOSUM62 and BLOSUM50 target alignments with 20% to 30% identity, while “shallow” scoring matrices (e.g., VTML10 to VTML80) target alignments that share 90% to 50% identity, reflecting much less evolutionary change. While “deep” matrices provide very sensitive similarity searches, they also require longer sequence alignments and can sometimes produce alignment overextension into nonhomologous regions. Shallower scoring matrices are more effective when searching for short protein domains, or when the goal is to limit the scope of the search to sequences that are likely to be orthologous between recently diverged organisms. Likewise, in DNA searches, the match and mismatch parameters set evolutionary look‐back times and domain boundaries. In this unit, we will discuss the theoretical foundations that drive practical choices of protein and DNA similarity scoring matrices and gap penalties. Deep scoring matrices (BLOSUM62 and BLOSUM50) should be used for sensitive searches with full‐length protein sequences, but short domains or restricted evolutionary look‐back require shallower scoring matrices. Curr. Protoc. Bioinform. 43:3.5.1‐3.5.9. © 2013 by John Wiley & Sons, Inc.
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
Cited by
Phage Lysis: Multiple Genes for Multiple Barriers
Cahill, J., & Young, R. (2019) · Advances in Virus Research · doi:10.1016/bs.aivir.2018.09.003 · Cited by 319
On the possible origin of protein homochirality, structure, and biochemical function
Skolnick, J., Zhou, H., & Gao, M. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1908241116 · Cited by 45
Assessing alignment-based taxonomic classification of ancient microbial DNA
Eisenhofer, R., & Weyrich, L. S. (2019) · PeerJ · doi:10.7717/peerj.6594 · Cited by 39
Metadata
- Authors
- Pearson, W. R.
- Venue
- Current Protocols in Bioinformatics
- Publisher
- Wiley
- Published
- 2013-10
- Volume
- 43
- Issue
- 1
- Pages
- 3.5.1-3.5.9
- ISSN
- 1934-3396 (ISSN-L)
- 1934-340X
- OpenAlex
- W1547142901
- Cited by
- 169
- References
- 0
- FWCI
- 1.48
- Type
- journal article
- Language
- en
- Open access
- green
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: Selecting the Right Similarity‐Scoring Matrix. https://app.cochat.ai/papers/10.1002/0471250953.bi0305s43
- The paper
- Pearson, W. R. (2013). Selecting the Right Similarity‐Scoring Matrix. Current Protocols in Bioinformatics. https://doi.org/10.1002/0471250953.bi0305s43
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.