U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Computer based system and method for determining and displaying possible chemical structures for converting double- or multiple-chain polypeptides to single-chain polypeptides

Patent 4881175 Issued on November 14, 1989. Estimated Expiration Date: Icon_subject June 9, 2008. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Keyboard operated apparatus for simultaneous coding and display of chemical structure and similar graphical information
Patent #: 4085443
Issued on: 04/18/1978
Inventor: Dubois, et al.

Processor for a graphic terminal
Patent #: 4266253
Issued on: 05/05/1981
Inventor: Matherat

Method and apparatus for making correlations and predictions using a finite field of data of unorganized and/or partially structured elements
Patent #: 4414629
Issued on: 11/08/1983
Inventor: Waite

Computer based system and method for determining and displaying possible chemical structures for converting double- or multiple-chain polypeptides to single-chain polypeptides
Patent #: 4704692
Issued on: 11/03/1987
Inventor: Ladner

Method and apparatus for determining the chemical structure of an unknown substance Patent #: 4719582
Issued on: 01/12/1988
Inventor: Ishida ,   et al.

Inventor

Assignee

Application

No. 204940 filed on 06/09/1988

US Classes:

702/138, Pressure436/86, PEPTIDE, PROTEIN OR AMINO ACID436/89, Amino acid or sequencing procedure703/11, Biological or biochemical706/932Mathematics, science, or engineering

Examiners

Primary: Lall, Parshotam S.
Assistant: Mattson, Brian M.

Attorney, Agent or Firm

International Classes

G06F 015/46
G01N 033/00

Abstract

A computer based system and method determines and displays possible chemical structures for converting two naturally aggregated but chemically separated polypeptide chains into a single polypeptide chain which will fold into a three dimensional structure very similar to the original structure made of the two polypeptide chains. A data base contains a large number of amino acid sequences for which the three dimensional structure is known. After plausible sites have been selected, this data base is examined to find which amino acid sequences (linkers) can bridge the gap between the plausible sites to create a plausible one-polypeptide structure. The testing of each possible linker proceeds in three steps. First, the span (a scalar quantity) of the candidate is compared to the span of the gap. If the span is close enough, step two is done which involves aligning the first peptides of the candidate with the initial peptide of the gap. The three dimensional vector from tail to head of the candidate is compared to the three dimensional vector from tail to head of the gap. If there is a sufficient match between the two vectors, step three is done, which involves fitting the termini of the candidate (using, for example, a least squares procedure) to the termini of the gap. If these two termini fit well enough, the candidate is enrolled for a ranking process.

Other References

  • Small Business Innovation Phase I Grant Application of Creative BioMolecules, Inc., Aug. 1984
  • Small Business Innovation Phase II Grant Application of Creative BioMolecules, Inc., Dec. 198
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
 
Sign InRegister
Username  
Password   
forgot password?