Pengoptimuman Alignment Struktur Protein Menggunakan Clique Maksimum

Abstract

An alignment of protein structures describes the relationship of two types of proteins similarity function. The problems of the protein structure alignments can be identified through the problems of the Contact Map Overlap (CMO). The problems of CMO can be solved by finding a maximum clique in a graph, where vertices and edges represent the amino acids and contacts between any two amino acids respectively. In this paper, the problem of finding maximum cliques is using two main steps, the arranging vertices and edges based on the special properties of the graph and preprocessing vertices. Implementation of the model is done by using the structure of a hypothetical protein.