Model Optimisasi pada Bioinformatik

Abstract

Biomolecular models presented by a graph G(V,E), where each node v in the set v (v € V) are presented in the form of biomolecules, such that as the genome, and each edge ¢ in the set V (v € V) which is a interaction or relationship between the nodes in V. Undirected graph G(V,E), where each node is presented by the genome, and cach edge is presented as a binary interaction (valued binary) or an interaction with a confidence value (value continuously) between the two genomes. By defining two biomolekular in the form of graph is Gy (Vi, EyJand Go(Va, Ba) where Vi = {v},ub, vib, Va = {of,vh,,0h} and By = {et,¢3,,€)}, Ey = {€?,€,,€2} is modeled in the form of graph bipartisi. The method used in this research és the graph model approach of the strands annotated (annotated sequences) outlining and interactions edge. The set of k strand of annotated and input model as a mixed graph, the set of verter of the graph which ts the base of the strand. The set of the undirected edge alignment (undirected) of the two strands of different inputs which set of codes annotation of strands which interactions between the edge and garlands same verter. Structural alignment of a sct of strands annotation to an alignment such that the weight of the edge is added to the weight of interaction is a maximum matching. A polyhedral approach the optimal solution, for mited integer nonlinear programming.