Protein Threading: From Mathematical Models to Parallel Implementations

Published Online:https://doi.org/10.1287/ijoc.1040.0092

References

  • Akutsu T., Miyano S. On the approximation of protein threading. Theoret. Comput. Sci. (1999) 210:261–275CrossrefGoogle Scholar
  • Cornuéjols G., Nemhauser G. L., Wolsey L. A., Mirchandani P., Francis R. The uncapacitated facility location problem. Discrete Location Theory (1990) (John Wiley and Sons, New York) 119–171Google Scholar
  • Head-Gordon T., Wooley J. Computational challenges in structural and functional genomics. IBM Systems J. (2001) 40:265–295CrossrefGoogle Scholar
  • Lathrop R. The protein threading problem with sequence amino acid interaction preferences is NP-complete. Protein Engrg. (1994) 7:1059–1068CrossrefGoogle Scholar
  • Lathrop R., Smith T. Global optimum threading with gapped alignment and empirical pair score functions. J. Molecular Biol. (1996) 255:641–665CrossrefGoogle Scholar
  • Lathrop R., Rogers R., Bienkowska J., Bryant B., Butorovic L., Gaitatzes C., Nambudripad R., White J., Smith T., Salzberg S. L., Searls D. B., Kasif S. Analysis and algorithms for protein sequence-structure alignment. Computational Methods in Molecular Biology (1998) (Elsevier Science, Amsterdam, The Netherlands) 227–283CrossrefGoogle Scholar
  • Lengauer T., Wilhelm R. Computational biology at the beginning of the post-genomic era. Informatics—10 Years Back, 10 Years Ahead. Lecture Notes in Computer Science (2001) (Springer-Verlag, Heidelberg, Germany) 341–355No. 2000CrossrefGoogle Scholar
  • Marin A., Pothier J., Zimmermann K., Gibrat J.-F. FROST: A filter based recognition method. Proteins (2002a) 49:493–509CrossrefGoogle Scholar
  • Marin A., Pothier J., Zimmermann K., Gibrat J.-F., Tsigelny. Protein threading statistics: An attempt to assess the significance of a fold assignment to a sequence. Protein Structure Prediction: Bioinformatic Approach, I (2002b) (International University Line, La Jolla, CA) 227–262Google Scholar
  • Plastria F. Formulating logical implications in combinatorial optimization. Eur. J. Oper. Res. (2002) 140:338–353CrossrefGoogle Scholar
  • Setubal J. C., Meidanis J.Introduction to Computational Molecular Biology (1997) (Brooks/Cole Publishing Company, Pacific Grove, CA) 252–259Google Scholar
  • Xu J. Speedup LP approach to protein threading via graph reduction. Third Workshop on Algorithms in Bioinformatics, Lecture Notes in Computer Science (2003) 374–388No. 2812CrossrefGoogle Scholar
  • Xu J., Li M., Lin G., Kim D., Xu Y. Protein threading by linear programming. Proc. Seventh Pacific Sympos. Biocomput. (PSB) (2003a) 264–275Google Scholar
  • Xu J., Li M., Lin G., Kim D., Xu Y. RAPTOR: Optimal protein threading by linear programming. J. Bioinformatics Comput. Biol. (2003b) 1:95–117CrossrefGoogle Scholar
  • Xu Y., Xu D. Protein threading using PROSPECT: Design and evaluation. Proteins: Structure, Function, and Genetics (2000) 40:343–354CrossrefGoogle Scholar
  • Xu Y., Xu D., Uberbacher E. An efficient computational method for globally optimal threading. J. Comput. Biol. (1998) 5:597–614CrossrefGoogle Scholar
  • Yanev N. Solution of a simple plant-location problem. USSR Comput. Math. Math. Phys. (1981) 21:626–634translation fromZh. Vychisl. Mat. Mat. Fiz.21CrossrefGoogle Scholar
  • Yanev N., Andonov R. The protein threading problem is in P? (2002) . Research Report 4577 Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau, Rocquencourt, France, http://www.inria.fr/Google Scholar
  • Yanev N., Andonov R. Solving the protein threading problem in parallel. Workshop on HiCOMB'03, Seventeenth IPDPS (2003) (Nice, France) . http://www.hicomb.org/CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.