Recent Advances in Solving the Protein Threading Problem

نویسندگان

  • Rumen Andonov
  • Guillaume Collet
  • Jean-François Gibrat
  • Antoine Marin
  • Vincent Poirriez
  • Nicola Yanev
چکیده

The fold recognition methods are promissing tools for capturing the structure of a protein by its amino acid residues sequence but their use is still restricted by the needs of huge computational resources and suitable efficient algorithms as well. In the recent version of FROST (Fold Recognition Oriented Search Tool) package the most efficient algorithm for solving the Protein Threading Problem (PTP) is implemented due to the strong collaboration between the SYMBIOSE group in IRISA and MIG in Jouy-en-Josas. In this paper, we present the diverse components of FROST, emphasizing on the recent advances in formulating and solving new versions of the PTP and on the way of solving on a computer cluster a million of instances in a reasonable time. Key-words: Protein Threading Problem, Protein Structure, Parallel Processing ∗ IRISA, Campus de Beaulieu, 35042 Rennes, France † INRA, Unité Mathématique Informatique et Génome UR1077, F-78352 Jouy-en-Josas ‡ LAMIH, UMR CNRS 8530, Université de Valenciennes,59313 Valenciennes, France § University of Sofia, 5 J. Bouchier Str., 1126 Sofia, Bulgaria Nouvelles avancées dans la reconnaissance de repliements Résumé : Parmi les méthodes informatiques permettant de trouver la structure d’une protéine à partir de sa seule séquence, les méthodes par reconnaissance de repliements semblent prometteuses. Néanmoins, ces méthodes demandent une très grande quantité de ressources ainsi que des algorithmes performants. Le logiciel FROST (Fold Recognition Oriented Search Tool) implémente une méthode de reconnaissance de repliement qui est le fruit d’une étroite collaboration entre l’équipe Symbiose de l’IRISA et l’unité MIG de l’INRA de Jouy-en-Josas. Nous présentons ici les différentes composantes de FROST et les dernières avancées réalisées afin de résoudre efficacement le problème du Protein Threading. En particulier, nous présentons une version parallélisée de FROST permettant de résoudre un grand nombre d’instances en un temps raisonnable. Mots-clés : Reconnaissance de repliement, structure des protéines, parallélisation Recent Advances in Solving the Protein Threading Problem 3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Protein Threading by Cost-Splitting

In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignment problem we apply costsplitting technique to derive a new Lagrangian dual formulation. The optimal solution of the dual is sought by an algorithm of polynomial complexity. For most of the instances the dual solution provides ...

متن کامل

Clique-based algorithms for protein threading with profiles and constraints

Protein threading with profiles in which constraints on distances between residues are given is known to be NP-hard. Moreover, a simple algorithm known as CLIQUETHREAD based on efficient reduction to maximum edge-weight clique finding problem has been known to be a practical algorithm for solving the protein threading problem with profiles and constraints. This algorithm is not efficient enough...

متن کامل

Solving the Protein Threading Problem in Parallel

We propose a network flow formulation for protein threading and show its equivalence with the shortest path problem on a graph with a very particular structure. The underying Mixed Integer Programming (MIP) model proves to be very appropriate for the protein threading problem–huge real-life instances have been solved in a reasonable time by using only a Mixed Integer Optimizer instead of a spec...

متن کامل

Lagrangian approaches for a class of matching problems in computational biology

This paper presents efficient algorithms for solving the problem of aligning a protein structure template to a query amino-acid sequence, known as protein threading problem. We consider the problem as a special case of graph matching problem. We give formal graph and integer programming models of the problem. After studying the properties of these models, we propose two kinds of Lagrangian rela...

متن کامل

Recent Advances in High Cell Density Cultivation for Production of Recombinant Protein

This paper reviews recent strategies used for increasing specific yield and productivity in high cell density cultures. High cell density cultures offer an efficient means for the economical production of recombinant proteins. However, there are still some challenges associated with high cell density cultivation (HCDC) techniques. A variety of strategies in several aspects including host design...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0707.3750  شماره 

صفحات  -

تاریخ انتشار 2007