The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Flexible Sequence Similarity Searching with the FASTA3 Program Package
Abstract
The FASTA3 and FASTA2 packages provide a flexible set of sequence-comparison programs that are particularly valuable because of their accurate statistical estimates and high-quality alignments. Traditionally, sequence similarity searches have sought to ask one question: "Is my query sequence homologous to anything in the database?" Both FASTA and BLAST can provide reliable answers to this question with their statistical estimates; if the expectation value E is < 0.001-0.01 and you are not doing hundreds of searches a day, the answer is probably yes. In general, the most effective search strategies follow these rules: 1. Whenever possible, compare at the amino acid level, rather than the nucleotide level. Search first with protein sequences (blastp, fasta3, and ssearch3), then with translated DNA sequences (fastx, blastx), and only at the DNA level as a last resort (Table 5). 2. Search the smallest database that is likely to contain the sequence of interest (but it must contain many unrelated sequences for accurate statistical estimates). 3. Use sequence statistics, rather than percent identity or percent similarity, as your primary criterion for sequence homology. 4. Check that the statistics are likely to be accurate by looking for the highest-scoring unrelated sequence, using prss3 to confirm the expectation, and searching with shuffled copies of the query sequence [randseq, searches with shuffled sequences should have E approx 1.0]. 5. Consider searches with different gap penalties and other scoring matrices. Searches with long query sequences against full-length sequence libraries will not change dramatically when BLOSUM62 is used instead of BLOSUM50 (20), or a gap penalty of -14/-2 is used in place of -12/-2. However, shallower or more stringent scoring matrices are more effective at uncovering relationships in partial sequences (3,18), and they can be used to sharpen dramatically the scope of the similarity search. However, as illustrated in the last section, the E value is only the first step in characterizing a sequence relationship. Once one has confidence that the sequences are homologous, one should look at the sequence alignments and percent identities, particularly when searching with lower quality sequences. When sequence alignments are very short, the alignment should become more significant when a shallower scoring matrix is used, e.g., BLOSUM62 rather than BLOSUM50 (remember to change the gap penalties). Homology can be reliably inferred from statistically significant similarity. Whereas homology implies common three-dimensional structure, homology need not imply common function. Orthologous sequences usually have similar functions, but paralogous sequences often acquire very different functional roles. Motif databases, such as PROSITE (21), can provide evidence for the conservation of critical functional residues. However, motif identity in the absence of overall sequence similarity is not a reliable indicator of homology.
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
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
A simple method for displaying the hydropathic character of a protein
Kyte, J., & Doolittle, R. F. (1982) · Journal of Molecular Biology · doi:10.1016/0022-2836(82)90515-0 · Cited by 22,843
Improved tools for biological sequence comparison.
Pearson, W. R., & Lipman, D. J. (1988) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.85.8.2444 · Cited by 11,227
Self-citationIdentification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
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
Rapid and sensitive protein similarity searches
Lipman, D. J., & Pearson, W. R. (1985) · Science · doi:10.1126/science.2983426 · Cited by 4,033
Self-citationRapid similarity searches of nucleic acid and protein data banks.
Wilbur, W. J., & Lipman, D. J. (1983) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.80.3.726 · Cited by 1,546 · cited 9×
“When rapid sequence comparison programs were first introduced in 1983 (1), it became possible to find similar DNA and protein sequences by searching sequence databases, but there was no formal basis for deciding whether a weak similarity was likely to be biologically significant.”
BackgroundMethodInfluentialKarlin, S., & Altschul, S. F. (1990) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.87.6.2264 · Cited by 1,535
Optimal alignments in linear space
Myers, E. W., & Miller, W. (1988) · Bioinformatics · doi:10.1093/bioinformatics/4.1.11 · Cited by 1,235
A time-efficient, linear-space local similarity algorithm
Huang, X., & Miller, W. (1991) · Advances in Applied Mathematics · doi:10.1016/0196-8858(91)90017-d · Cited by 1,004
Prosite: a dictionary of sites and patterns in proteins
Bairoch, A. (1992) · Nucleic Acids Research · doi:10.1093/nar/20.suppl.2013 · Cited by 927
Issues in searching molecular sequence databases
Altschul, S. F., Boguski, M. S., Gish, W., & Wootton, J. C. (1994) · Nature Genetics · doi:10.1038/ng0294-119 · Cited by 774
Statistics of local complexity in amino acid sequences and sequence databases
Wootton, J. C., & Federhen, S. (1993) · Computers & Chemistry · doi:10.1016/0097-8485(93)85006-x · Cited by 729
[27] Local alignment statistics
Altschul, S. F., & Gish, W. (1996) · Methods in Enzymology · doi:10.1016/s0076-6879(96)66029-7 · Cited by 723
Amino acid substitution matrices from an information theoretic perspective
Altschul, S. F. (1991) · Journal of Molecular Biology · doi:10.1016/0022-2836(91)90193-a · Cited by 633
Comparison of DNA Sequences with Protein Sequences
Pearson, W. R., Wood, T., Zhang, Z., & Miller, W. (1997) · Genomics · doi:10.1006/geno.1997.4995 · Cited by 600
Self-citationComparison of methods for searching protein sequence databases
Pearson, W. R. (1995) · Protein Science · doi:10.1002/pro.5560040613 · Cited by 336
Self-citationEmpirical statistical estimates for sequence similarity searches
Pearson, W. R. (1998) · Journal of Molecular Biology · doi:10.1006/jmbi.1997.1525 · Cited by 334
Self-citationA new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons
Waterman, M. S., & Eggert, M. (1987) · Journal of Molecular Biology · doi:10.1016/0022-2836(87)90478-5 · Cited by 292
The PIR-International Protein Sequence Database
Barker, W. C., Garavelli, J. S., McGarvey, P. B., Marzec, C. R., Orcutt, B. C., Srinivasarao, G. Y., Yeh, L.-S. L., Ledley, R. S., Mewes, H.-W., Pfeiffer, F., et al. (1999) · Nucleic Acids Research · doi:10.1093/nar/27.1.39 · Cited by 244
OWL--a non-redundant composite protein sequence database.
Bleasby, A. J., Akrigg, D., & Attwood, T. K. (1994) · PubMed · Cited by 131
Identifying distantly related protein sequences
Pearson, W. R. (1997) · Computer applications in the biosciences · doi:10.1093/bioinformatics/13.4.325 · Cited by 53
Self-citation
Cited by
Krogh, A., Larsson, B., von Heijne, G., & Sonnhammer, E. L. L. (2001) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.4315 · Cited by 12,654
Accelerated Profile HMM Searches
Eddy, S. R. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002195 · Cited by 6,975
“The heuristic approaches in BLAST and FASTA have the advantage of focusing subsequent slower computations on particular diagonals, whereas in HMMER’s current approach, we wastefully recalculate full sequence alignments at each step of the acceleration pipeline.”
MethodInfluentialVersatile and open software for comparing large genomes
Kurtz, S., Phillippy, A., Delcher, A. L., Smoot, M., Shumway, M., Antonescu, C., & Salzberg, S. L. (2004) · Genome Biology · doi:10.1186/gb-2004-5-2-r12 · Cited by 5,254
Comparative Protein Structure Modeling Using Modeller
Eswar, N., Webb, B., Marti‐Renom, M. A., Madhusudhan, M. S., Eramian, D., Shen, M., Pieper, U., & Sali, A. (2006) · Current Protocols in Bioinformatics · doi:10.1002/0471250953.bi0506s15 · Cited by 4,478
Genome sequence of the human malaria parasite Plasmodium falciparum
Gardner, M. J., Hall, N., Fung, E., White, O., Berriman, M., Hyman, R. W., Carlton, J. M., Pain, A., Nelson, K. E., Bowman, S., et al. (2002) · Nature · doi:10.1038/nature01097 · Cited by 4,407
Metadata
- Authors
- Pearson, W. R.
- Venue
- Bioinformatics Methods and Protocols
- Publisher
- Humana Press
- Published
- 2003-11-14
- Volume
- 132
- Pages
- 185-219
- OpenAlex
- W53898165
- Cited by
- 600
- References
- 23
- FWCI
- 69.62
- Type
- book chapter
- 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.