Abstract
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.
Keywords
DatabaseBiologyBlock (permutation group theory)Set (abstract data type)Sequence databaseRelational databaseSequence (biology)Sequence alignmentProtein structure databaseDatabase search engineComputer scienceData miningComputational biologyInformation retrievalGeneticsPeptide sequenceSearch engineMathematicsCombinatoricsGeneProgramming language
Affiliated Institutions
Related Publications
BLAST and FASTA Similarity Searching for Multiple Sequence Alignment
BLAST, FASTA, and other similarity searching programs seek to identify homologous proteins and DNA sequences based on excess sequence similarity. If two sequences share much mor...
Probability-based protein identification by searching sequence databases using mass spectrometry data
Several algorithms have been described in the literature for protein identification by searching a sequence database using mass spectrometry data. In some approaches, the experi...
Efficient large-scale sequence comparison by locality-sensitive hashing
Abstract Motivation: Comparison of multimegabase genomic DNA sequences is a popular technique for finding and annotating conserved genome features. Performing such comparisons e...
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and s...
TIGRFAMs: a protein family resource for the functional identification of proteins
TIGRFAMs is a collection of protein families featuring curated multiple sequence alignments, hidden Markov models and associated information designed to support the automated fu...
Publication Info
- Year
- 1991
- Type
- article
- Volume
- 19
- Issue
- 23
- Pages
- 6565-6572
- Citations
- 464
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
464
OpenAlex
Cite This
Steven Henikoff,
Jorja G. Henikoff
(1991).
Automated assembly of protein blocks for database searching.
Nucleic Acids Research
, 19
(23)
, 6565-6572.
https://doi.org/10.1093/nar/19.23.6565
Identifiers
- DOI
- 10.1093/nar/19.23.6565