2009 | OriginalPaper | Chapter
Iterative Lattice Protein Design Using Template Matching
Author : David Olivieri
Published in: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
An approach to the inverse protein folding problem is described which combines a simulated annealing algorithm with template matching using the Bellman criteria. Solutions to proposed target structures are found by iteratively constructing the most similar solution. The folding model is based upon the traditional 2D HP protein lattice with a modified Viterbi dynamic programming algorithm. Initial results of both the optimal folding problem and the inverse protein problem are presented.