Exhaustive Matching of the Entire Protein Sequence Database
- 5 June 1992
- journal article
- research article
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 256 (5062) , 1443-1445
- https://doi.org/10.1126/science.1604319
Abstract
The entire protein sequence database has been exhaustively matched. Definitive mutation matrices and models for scoring gaps were obtained from the matching and used to organize the sequence database as sets of evolutionarily connected components. The methods developed are general and can be used to manage sequence data generated by major genome sequencing projects. The alignments made possible by the exhaustive matching are the starting point for successful de novo prediction of the folded structures of proteins, for reconstructing sequences of ancient proteins and metabolisms in ancient organisms, and for obtaining new perspectives in structural biochemistry.Keywords
This publication has 22 references indexed in Scilit:
- Amino acid substitution matrices from an information theoretic perspectivePublished by Elsevier ,2005
- The human genome project: creating an infrastructure for biology and medicineTrends in Biochemical Sciences, 1991
- Prediction of progress at lastNature, 1991
- Spinning in hyperspaceNature, 1991
- The ribonuclease from an extinct bovid ruminantFEBS Letters, 1990
- Improving the prediction of secondary structure of –TIM-barrel— enzymesProtein Engineering, Design and Selection, 1990
- Knowledge-based prediction of protein structures and the design of novel moleculesNature, 1987
- Toward Defining the Course of Evolution: Minimum Change for a Specific Tree TopologySystematic Zoology, 1971
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970
- The Configuration of Random Polypeptide Chains. I. Experimental ResultsJournal of the American Chemical Society, 1965