Advertisement

Speedup LP Approach to Protein Threading via Graph Reduction

  • Jinbo Xu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2812)

Abstract

In our protein structure prediction computer program RAPTOR, we have implemented a linear programming (LP) approach to protein threading based on the template contact map graph. Our protein threading model considers pairwise contact potential rigorously. In order to further improve the computational efficiency of our LP approach, this paper proposes a graph reduction technique to reduce a template contact graph to a new one with fewer vertices and edges. Our graph reduction operation is formalized to minimize the number of variables, constraints and non-zero elements in the constraint matrix of our linear programs. These three factors are key to the computational time of solving linear programs by both the Simplex method and the Interior-Point method. This graph reduction technique does not impact the quality of protein threading (i.e., the energy function is still globally optimized). Experiments show that the more a template contact graph can be reduced, the more computational efficiency improvement can be attained and that in average, the computational efficiency of threading any long sequence to the whole template database can be improved by 30%.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Xu, J., Li, M., Lin, G., Kim, D., Xu, Y.: Protein threading by linear programming. In: Biocomputing: Proceedings of the 2003 Pacific Symposium, Hawaii, USA, pp. 264–275 (2003)Google Scholar
  2. 2.
    Xu, J., Li, M., Kim, D., Xu, Y.: RAPTOR: optimal protein threading by linear programming. Journal of Bioinformatics and Computational Biology 1(1), 95–117 (2003)CrossRefGoogle Scholar
  3. 3.
    Fischer, D.: (December 2002), http://www.cs.bgu.ac.il/~dfischer/CAFASP3/
  4. 4.
    Lathrop, R.H.: The protein threading problem with sequence amino acid interaction preferences is NP-complete. Protein Engineering 7, 1059–1068 (1994)CrossRefGoogle Scholar
  5. 5.
    Godzik, A., Skolnick, J.: Sequence-structure matching in globular proteins: application to supersecondary and tertiary structure determination. PNAS 89, 12098–12102 (1992)CrossRefGoogle Scholar
  6. 6.
    Bryant, S.H., Lawrence, C.E.: An empirical energy function for threading protein sequence through folding motif. Proteins: Structure, Function and Genetics 16, 92–112 (1993)CrossRefGoogle Scholar
  7. 7.
    Xu, Y., Xu, D., Uberbacher, E.C.: An efficient computational method for globally optimal threadings. Journal of Computational Biology 5(3), 597–614 (1998)CrossRefGoogle Scholar
  8. 8.
    Lathrop, R.H., Smith, T.F.: Global optimum protein threading with gapped alignment and empirical pair score functions. Journal of Molecular Biology 255, 641–665 (1996)CrossRefGoogle Scholar
  9. 9.
    Yanev, N., Andonov, R.: Protein threading is in P? Technical Report INRIA RR-4577, French (October 2002)Google Scholar
  10. 10.
    Lathrop, R.H., Smith, T.F.: A branch-and-bound algorithm for optimal protein threading with pairwise (contact potential) amino acid interactions. IEEE Computer Society Press, Los Alamitos (1994)Google Scholar
  11. 11.
  12. 12.
    Rychlewski, L. (2002), http://www.bioinfo.pl/livebench/6

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jinbo Xu
    • 1
  1. 1.Department of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations