US5933819A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Prediction of relative binding motifs of biologically active peptides and peptide mimetics
Assignee: Scripps Research Institute
•
Filing: 1997-05-23
•
Granted: 1999-08-03
•
Expires: 2017-05-23
Abstract
Abstract A general neural network based method and system for identifying peptide binding motifs from limited experimental data. In particular, an artificial neural network (ANN) is trained with peptides with known sequence and function (i.e., binding strength) identified from a phage display library. The ANN is then challenged with unknown peptides, and predicts relative binding motifs. Analysis of the unknown peptides validate the predictive capability of the ANN.
Inventors
- 👤 Jeffrey Skolnick
- 👤 Mariusz Milik
- 👤 Andrezej Kolinski
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 22:04
CPC Classifications
C; C07; C07K; C07K1/00
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
90 words
A computer-implemented method for identifying relative binding motifs of peptide-like molecules, comprising the steps of: (a) training a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptide-like molecules, each of known sequence and binding affinity; (b) applying to the ANN input data characterizing at least one test peptide-like molecule, each of known sequence but unknown binding affinity; (c) analyzing each applied test peptide-like molecule using the ANN to generate a prediction of a relative binding affinity for each test peptide-like molecule, and outputting such prediction.
Claim 2
Dependent Claim
90 words
A computer-implemented method for identifying relative binding motifs of peptide-like molecules, comprising the steps of: (a) training a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptide-like molecules, each of known sequence and binding affinity; (b) applying to the ANN input data characterizing at least one test peptide-like molecule, each of known sequence but unknown binding affinity; (c) analyzing each applied test peptide-like molecule using the ANN to generate a prediction of a relative binding affinity for each test peptide-like molecule, and outputting such prediction.
Claim 3
Dependent Claim
129 words
A computer-implemented method for identifying relative peptide binding motifs, comprising the steps of: (a) training a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptides, each of known binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (b) applying to the ANN input data characterizing at least one test peptide, each of unknown binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (c) analyzing each applied test peptide using the ANN to generate a prediction of a relative binding affinity for each test peptide, and outputting such prediction.
Claim 4
Dependent Claim
129 words
A computer-implemented method for identifying relative peptide binding motifs, comprising the steps of: (a) training a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptides, each of known binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (b) applying to the ANN input data characterizing at least one test peptide, each of unknown binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (c) analyzing each applied test peptide using the ANN to generate a prediction of a relative binding affinity for each test peptide, and outputting such prediction.
Claim 5
Dependent Claim
25 words
The method of claim 2, wherein the set of training peptides include peptides having a binding affinity for major histocompatiblity complex (MHC) class I molecules.
Claim 6
Dependent Claim
27 words
The method of claim 3, wherein the peptides included in the set of training peptides have a binding affinity for mouse MHC class I K b .
Claim 7
Dependent Claim
22 words
The method of claim 2, wherein the set of test peptides include peptides having a binding affinity for MHC class I molecules.
Claim 8
Dependent Claim
27 words
The method of claim 5, wherein the peptides included in the set of test peptides have a binding affinity for mouse MHC class I K b .
Claim 9
Independent Claim
20 words
The method of claims 1 or 2, wherein the ANN comprises a multi-layer perceptron ANN trained by back-propagation of error.
Claim 10
Dependent Claim
93 words
A computer-implemented system for identifying relative binding motifs for peptide-like molecules, comprising: (a) means for training a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptide-like molecules, each of known sequence and binding affinity; (b) means for applying to the ANN input data characterizing at least one test peptide-like molecule, each of known sequence but unknown binding affinity; (c) means for analyzing each applied test peptide-like molecule using the ANN to generate a prediction of a relative binding affinity for each test peptide-like molecule, and output such prediction.
Claim 11
Dependent Claim
93 words
A computer-implemented system for identifying relative binding motifs for peptide-like molecules, comprising: (a) means for training a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptide-like molecules, each of known sequence and binding affinity; (b) means for applying to the ANN input data characterizing at least one test peptide-like molecule, each of known sequence but unknown binding affinity; (c) means for analyzing each applied test peptide-like molecule using the ANN to generate a prediction of a relative binding affinity for each test peptide-like molecule, and output such prediction.
Claim 12
Dependent Claim
132 words
A computer-implemented system for identifying relative peptide binding motifs, comprising: (a) means for training a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptides, each of known binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (b) means for applying to the ANN input data characterizing at least one test peptide, each of unknown binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (c) means for analyzing each applied test peptide using the ANN to generate a prediction of a relative binding affinity for each test peptide, and output such prediction.
Claim 13
Dependent Claim
132 words
A computer-implemented system for identifying relative peptide binding motifs, comprising: (a) means for training a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptides, each of known binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (b) means for applying to the ANN input data characterizing at least one test peptide, each of unknown binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (c) means for analyzing each applied test peptide using the ANN to generate a prediction of a relative binding affinity for each test peptide, and output such prediction.
Claim 14
Dependent Claim
25 words
The system of claim 9, wherein the set of training peptides include peptides having a binding affinity for major histocompatiblity complex (MHC) class I molecules.
Claim 15
Dependent Claim
27 words
The system of claim 10, wherein the peptides included in the set of training peptides have a binding affinity for mouse MHC class I K b .
Claim 16
Dependent Claim
22 words
The system of claim 9, wherein the set of test peptides include peptides having a binding affinity for MHC class I molecules.
Claim 17
Dependent Claim
27 words
The system of claim 12, wherein the peptides included in the set of test peptides have a binding affinity for mouse MHC class I K b .
Claim 18
Independent Claim
20 words
The system of claims 8 or 9, wherein the ANN comprises a multi-layer perceptron ANN trained by back-propagation of error.
Claim 19
Dependent Claim
98 words
A computer program, residing on a computer-readable medium, for identifying relative binding motifs for peptide-like molecules, comprising instructions for causing a computer to: (a) train a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptide-like molecules, each of known sequence and binding affinity; (b) apply to the ANN input data characterizing at least one test peptide-like molecule, each of known sequence but unknown binding affinity; (c) analyze each applied test peptide-like molecule using the ANN to generate a prediction of a relative binding affinity for each test peptide-like molecule, and output such prediction.
Claim 20
Dependent Claim
98 words
A computer program, residing on a computer-readable medium, for identifying relative binding motifs for peptide-like molecules, comprising instructions for causing a computer to: (a) train a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptide-like molecules, each of known sequence and binding affinity; (b) apply to the ANN input data characterizing at least one test peptide-like molecule, each of known sequence but unknown binding affinity; (c) analyze each applied test peptide-like molecule using the ANN to generate a prediction of a relative binding affinity for each test peptide-like molecule, and output such prediction.
Claim 21
Dependent Claim
137 words
A computer program, residing on a computer-readable medium, for identifying relative peptide binding motifs, comprising instructions for causing a computer to: (a) train a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptides, each of known binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (b) apply to the ANN input data characterizing at least one test peptide, each of unknown binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (c) analyze each applied test peptide using the ANN to generate a prediction of a relative binding affinity for each test peptide, and output such prediction.
Claim 22
Dependent Claim
137 words
A computer program, residing on a computer-readable medium, for identifying relative peptide binding motifs, comprising instructions for causing a computer to: (a) train a computer-implemented artificial neural network (ANN) with input data characterizing a set of training peptides, each of known binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (b) apply to the ANN input data characterizing at least one test peptide, each of unknown binding affinity, each peptide comprising a sequence of amino acids, each amino acid being binary coded as having or lacking specific features generally characteristic of amino acids; (c) analyze each applied test peptide using the ANN to generate a prediction of a relative binding affinity for each test peptide, and output such prediction.
Claim 23
Dependent Claim
24 words
The computer program of claim 16, wherein the set of training peptides having a binding affinity for major histocompatiblity complex (MHC) class I molecules.
Claim 24
Dependent Claim
28 words
The computer program of claim 17, wherein the peptides included in the set of training peptides have a binding affinity for mouse MHC class I K b .
Claim 25
Dependent Claim
23 words
The computer program of claim 16, wherein the set of test peptides include peptides having a binding affinity for MHC class I molecules.
Claim 26
Dependent Claim
27 words
The computer-program of claim 19, wherein the peptides included in the set of test peptides have a binding affinity for mouse MHC class I K b .
Claim 27
Dependent Claim
21 words
The computer program of claims 15 or 17, wherein the ANN comprises a multilayer perceptron ANN trained by back-propagation of error.
References Cited (Backward Citations)
US5862304A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-08-02 | 2003-02-01 | 2003-08-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-08-02 | 2007-02-01 | 2007-08-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-08-02 | 2011-02-01 | 2011-08-03 | $7700.00 | Window Closed / Lapsed |