Solving the Protein Threading Problem by Lagrangian Relaxation
This paper presents an efficient algorithm for aligning aquery amino-acid sequence to a protein 3D structure template. Solving this problem is one of the main steps of the methods of protein structure prediction by threading. We propose an integer programming model and solve it by branch-and-bound algorithm. The bounds are computed using a Lagrangian dual of the model which turns out to be much easier to solve than its linear programming relaxation. The Lagrangian relaxations are computed using a dynamic programming algorithm. The experimental results show that our algorithm outperforms the commonly used methods. The proposed algorithm is general enough and can be easily plugged in most of the threading tools in order to increase their performance.
Keywordsprotein threading protein structure prediction sequence-structure alignment integer programming dynamic programming Lagrangian relaxation and duality subgradient optimization
Unable to display preview. Download preview PDF.
- 3.Lathrop, R., Rogers Jr., R., Bienkowska, J., Bryant, B., Buturovic, L., Gaitatzes, C., Nambudripad, R., White, J., Smith, T.: Analysis and algorithms for protein sequence-structure alignment. In: Salzberg, S., Searls, D., Kasif, S. (eds.) Computational Methods in Molecular Biology, pp. 227–283. Elsevier Science, Amsterdam (1998)CrossRefGoogle Scholar
- 7.Andonov, R., Yanev, N.: Solving the protein threading problem in parallel. In: HiCOMB 2003 – Second IEEE International Workshop on High Performance Computational Biology (2003)Google Scholar
- 8.Andonov, R., Balev, S., Yanev, N.: Protein threading: From mathematical models to parallel implementations. INFORMS Journal on Computing (2004) (to appear)Google Scholar
- 10.Marin, A., Pothier, J., Zimmermann, K., Gibrat, J.F.: Protein threading statistics: an attempt to assess the significance of a fold assignment to a sequence. In: Tsigelny, I. (ed.) Protein structure prediction: bioinformatic approach, International University Line (2002)Google Scholar