Protein threading by linear programming

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 17/00 (2006.01) C07K 1/00 (2006.01) G01N 33/48 (2006.01) G01N 33/50 (2006.01) G01N 33/53 (2006.01) G06F 17/10 (2006.01) G06F 19/00 (2006.01)

Patent

CA 2415584

The present invention relates generally to biotechnology and information technology, and in particular, to a subfield known as bioinformatics. A specific aspect of the invention lies in the provision of a new method and system for predicting the three-dimensional structure of proteins. The main focus in this patent application is on the development of a globally optimal and practically efficient threading algorithm based on an alignment model incorporating pairwise interaction preferences explicitly, and allowing variable gaps by using an integer programming approach. Integer programming formulation can fully exploit the abovementioned special features of the pairwise interaction preferences. It allows one to use the existing powerful linear programming packages together with a branch and bound algorithm to rapidly arrive at the optimal alignment. This is the first time that integer programming and linear programming has been applied to protein threading.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Protein threading by linear programming does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Protein threading by linear programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Protein threading by linear programming will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1509254

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.