Title :
An Analytical Study of NP-Hard Protein Folding Problems
Author :
Thilagavathi, N. ; Amudha, T.
Author_Institution :
Dept. of Comput. Applic., Bharathiar Univ., Coimbatore, India
Abstract :
Protein folding problem is a Non deterministic Polynomial hard problem. Proteins are of different types, whereas each protein plays an important role in the living cells. Every protein has a unique structure and function. The unique structure is formed by folding of proteins from sequence of amino acids. In this paper, we have discussed about the proteins and its different types with their structures. Recently many computer algorithms are playing main role in the protein folding process. Every protein sequence have different types of folds and different energy levels. Energy levels are calculated from the Contacts between amino acid residues in different folding types. Machine learning techniques are used to fold proteins and predict the folding rates. Based on the sequence length, proteins are computed as short, medium and long range. Proteins sometimes incorrectly fold or unfold, many diseases will occur. Protein misfolding diseases are also briefed in this paper. Bioinspired algorithms are mostly used for this problem compared to other algorithms.
Keywords :
biology computing; computational complexity; learning (artificial intelligence); molecular configurations; proteins; NP-hard protein folding problem; amino acid residues; amino acid sequence; machine learning techniques; nondeterministic polynomial hard problem; protein folding problem; protein folding process; protein function; protein sequence; protein structure; Amino acids; Computational modeling; Diseases; Lattices; Proteins; Solid modeling; Three-dimensional displays; Bio-inspired Algorithms; Protein Structure; Protein folding;
Conference_Titel :
Intelligent Computing Applications (ICICA), 2014 International Conference on
Conference_Location :
Coimbatore
DOI :
10.1109/ICICA.2014.47