The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Automated assembly of protein blocks for database searching
Open accessAbstract
A system is described for finding and assembling the most highly conserved regions of related proteins for database searching. First, an automated version of Smith's algorithm for finding motifs is used for sensitive detection of multiple local alignments. Next, the local alignments are converted to blocks and the best set of non-overlapping blocks is determined. When the automated system was applied successively to all 437 groups of related proteins in the PROSITE catalog, 1764 blocks resulted; these could be used for very sensitive searches of sequence databases. Each block was calibrated by searching the SWISS-PROT database to obtain a measure of the chance distribution of matches, and the calibrated blocks were concatenated into a database that could itself be searched. Examples are provided in which distant relationships are detected either using a set of blocks to search a sequence database or using sequences to search the database of blocks. The practical use of the blocks database is demonstrated by detecting previously unknown relationships between oxidoreductases and by evaluating a proposed relationship between HIV Vif protein and thiol proteases.
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
[5] Rapid and sensitive sequence comparison with FASTP and FASTA
Pearson, W. R. (1990) · Methods in Enzymology · doi:10.1016/0076-6879(90)83007-v · Cited by 1,946
Profile analysis: detection of distantly related proteins.
Gribskov, M., McLachlan, A. D., & Eisenberg, D. (1987) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.84.13.4355 · Cited by 1,325
A workbench for multiple alignment construction and analysis
Schuler, G. D., Altschul, S. F., & Lipman, D. J. (1991) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340090304 · Cited by 985
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
The SWISS-PROT protein sequence data bank
Bairoch, A., & Boeckmann, B. (1992) · Nucleic Acids Research · doi:10.1093/nar/20.suppl.2019 · Cited by 529
Predictive motifs derived from cytosine methyltransferases
Pósfai, J., Bhagwat, A. S., Pósfai, G., & Roberts, R. J. (1989) · Nucleic Acids Research · doi:10.1093/nar/17.7.2421 · Cited by 491
Protein database searches for multiple alignments.
Altschul, S. F., & Lipman, D. J. (1990) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.87.14.5509 · Cited by 483
Automatic generation of primary sequence patterns from sets of related protein sequences.
Smith, R. F., & Smith, T. F. (1990) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.87.1.118 · Cited by 286
Identification of protein sequence homology by consensus template alignment
Taylor, W. R. (1986) · Journal of Molecular Biology · doi:10.1016/0022-2836(86)90308-6 · Cited by 278
A flexible method to align large numbers of biological sequences
Taylor, W. R. (1988) · Journal of Molecular Evolution · doi:10.1007/bf02143508 · Cited by 218
Finding sequence motifs in groups of functionally related proteins.
Smith, H. O., Annau, T. M., & Chandrasegaran, S. (1990) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.87.2.826 · Cited by 203
[7] Finding protein similarities with nucleotide sequence databases
Henikoff, S., Wallace, J. C., & Brown, J. P. (1990) · Methods in Enzymology · doi:10.1016/0076-6879(90)83009-x · Cited by 190
Self-citationPhosphotransferase sequence homology
Brenner, S. (1987) · Nature · doi:10.1038/329021a0 · Cited by 155
Detecting homology of distantly related proteins with consensus sequences
Patthy, L. (1987) · Journal of Molecular Biology · doi:10.1016/0022-2836(87)90200-2 · Cited by 153
A fast and sensitive multiple sequence alignment algorithm
Vingron, M., & Argos, P. (1989) · Computer applications in the biosciences · doi:10.1093/bioinformatics/5.2.115 · Cited by 107
Understanding structural relationships proteins of unsolved three‐dimensional structure
Burbaum, J. J., Starzyk, R. M., & SCHIMMEL, P. R. (1990) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.340070202 · Cited by 100
MacPattern: protein pattern searching on the Apple Macintosh
Fuchs, R. (1991) · Computer applications in the biosciences · doi:10.1093/bioinformatics/7.1.105 · Cited by 66
Attwood, T. K., Eliopoulos, E., & Findlay, J. B. C. (1991) · Gene · doi:10.1016/0378-1119(91)90168-b · Cited by 58
Keller, J. W., Baurick, K. B., Rutt, G. C., O'Malley, M., Sonafrank, N. L., Reynolds, R. A., Ebbesson, L. O. E., & Vajdos, F. F. (1990) · Journal of Biological Chemistry · doi:10.1016/s0021-9258(19)39393-7 · Cited by 53
Agmenellum quadruplicatum M.AquI, a novel modification methylase
Karreman, C., & de Waard, A. (1990) · Journal of Bacteriology · doi:10.1128/jb.172.1.266-272.1990 · Cited by 49
Cited by
Amino acid substitution matrices from protein blocks.
Henikoff, S., & Henikoff, J. G. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.22.10915 · Cited by 6,218
Self-citationPANTHER: A Library of Protein Families and Subfamilies Indexed by Function
Thomas, P. D., Campbell, M. J., Kejariwal, A., Mi, H., Karlak, B., Daverman, R., Diemer, K., Muruganujan, A., & Narechania, A. (2003) · Genome Research · doi:10.1101/gr.772403 · Cited by 2,944
Predicting Deleterious Amino Acid Substitutions
Ng, P. C., & Henikoff, S. (2001) · Genome Research · doi:10.1101/gr.176601 · Cited by 2,368
Self-citationThe PROSITE database, its status in 1995
Bairoch, A. (1996) · Nucleic Acids Research · doi:10.1093/nar/24.1.189 · Cited by 1,924
Detecting Subtle Sequence Signals: a Gibbs Sampling Strategy for Multiple Alignment
Lawrence, C. E., Altschul, S. F., Boguski, M. S., Liu, J. S., Neuwald, A. F., & Wootton, J. C. (1993) · Science · doi:10.1126/science.8211139 · Cited by 1,807
Metadata
- Authors
- Henikoff, S., & Henikoff, J. G.
- Venue
- Nucleic Acids Research
- Publisher
- Oxford University Press (OUP)
- Published
- 1991
- Volume
- 19
- Issue
- 23
- Pages
- 6565-6572
- ISSN
- 0305-1048 (ISSN-L)
- 1362-4962
- OpenAlex
- W1982496832
- Cited by
- 466
- References
- 20
- FWCI
- 9.26
- 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
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.