메뉴 건너뛰기




Volumn 159, Issue 16, 2011, Pages 1707-1716

Local protein threading by Mixed Integer Programming

Author keywords

Combinatorial optimization; Mixed Integer Programming; Protein structure alignment; Protein threading problem

Indexed keywords

COMPARE AND ANALYZE; LOCAL SIMILARITY; MIXED INTEGER PROGRAMMING; PROTEIN SEQUENCES; PROTEIN STRUCTURE ALIGNMENT; PROTEIN STRUCTURES; PROTEIN THREADING; PROTEIN THREADING PROBLEM;

EID: 80051792065     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.05.024     Document Type: Conference Paper
Times cited : (2)

References (14)
  • 1
    • 80051787927 scopus 로고    scopus 로고
    • Recent advances in solving the protein threading problem
    • E.-G. Talbi, A. Zomaya, Wiley-Interscience (chapter 14)
    • R. Andonov Recent advances in solving the protein threading problem E.-G. Talbi, A. Zomaya, Grids for Bioinformatics and Computational Biology 2007 Wiley-Interscience 325 356 (chapter 14)
    • (2007) Grids for Bioinformatics and Computational Biology , pp. 325-356
    • Andonov, R.1
  • 2
    • 10044297099 scopus 로고    scopus 로고
    • Protein threading: From mathematical models to parallel implementations
    • DOI 10.1287/ijoc.1040.0092, Computational Molecular Biology/ Bioinformatics
    • R. Andonov, S. Balev, and N. Yanev Protein threading problem: from mathematical models to parallel implementations INFORMS J. Comput. 16 4 2004 393 405 (Pubitemid 39597993)
    • (2004) INFORMS Journal on Computing , vol.16 , Issue.4 , pp. 393-405
    • Andonov, R.1    Balev, S.2    Yanev, N.3
  • 3
    • 0028015988 scopus 로고
    • The protein threading problem with sequence amino acid interaction preferences is NP-complete
    • R.H. Lathrop The protein threading problem with sequence amino acid interaction preferences is NP-complete Protein Eng. 255 1994 1059 1068 (Pubitemid 24282490)
    • (1994) Protein Engineering , vol.7 , Issue.9 , pp. 1059-1068
    • Lathrop, R.H.J.1
  • 4
    • 0029912991 scopus 로고    scopus 로고
    • Global optimum protein threading with gapped alignment and empirical pair score functions
    • DOI 10.1006/jmbi.1996.0053
    • R.H. Lathrop, and T.F. Smith Global optimum protein threading with gapped alignment and empirical pair potentials J. Mol. Biol. 255 1996 641 665 (Pubitemid 26107192)
    • (1996) Journal of Molecular Biology , vol.255 , Issue.4 , pp. 641-665
    • Lathrop, R.H.1    Smith, T.F.2
  • 6
    • 25144458667 scopus 로고    scopus 로고
    • A new progressive-iterative algorithm for multiple structure alignment
    • DOI 10.1093/bioinformatics/bti527
    • D. Lupyan, A. Leo-Macias, and A.R. Ortiz A new progressive-iterative algorithm for multiple structure alignment Bioinformatics 21 15 2005 3255 3263 (Pubitemid 41418439)
    • (2005) Bioinformatics , vol.21 , Issue.15 , pp. 3255-3263
    • Lupyan, D.1    Leo-Macias, A.2    Ortiz, A.R.3
  • 8
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • S.B. Needleman, and C.D. Wunsch A general method applicable to the search for similarities in the amino acid sequence of two proteins J. Mol. Biol. 48 3 1970 443 453
    • (1970) J. Mol. Biol. , vol.48 , Issue.3 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 9
    • 40749148575 scopus 로고    scopus 로고
    • On distance and similarity in fold space
    • DOI 10.1093/bioinformatics/btn040
    • M. Sippl On distance and similarity in fold space Bioinformatics 24 2008 872 873 (Pubitemid 351386931)
    • (2008) Bioinformatics , vol.24 , Issue.6 , pp. 872-873
    • Sippl, M.J.1
  • 10
    • 38849092210 scopus 로고    scopus 로고
    • A note on difficult structure alignment problems
    • DOI 10.1093/bioinformatics/btm622
    • M.J. Sippl, and M. Wiederstein A note on difficult structure alignment problems Bioinformatics 24 2008 426 427 (Pubitemid 351189021)
    • (2008) Bioinformatics , vol.24 , Issue.3 , pp. 426-427
    • Sippl, M.J.1    Wiederstein, M.2
  • 11
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • T.F. Smith, and M.S. Waterman Identification of common molecular subsequences J. Mol. Biol. 147 1981 195 197
    • (1981) J. Mol. Biol. , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 12
    • 0242369082 scopus 로고    scopus 로고
    • RAPTOR: Optimal protein threading by linear programming
    • J. Xu RAPTOR: optimal protein threading by linear programming J. Bioinformatics Comput. Biol. 1 1 2003 95 118
    • (2003) J. Bioinformatics Comput. Biol. , vol.1 , Issue.1 , pp. 95-118
    • Xu, J.1
  • 13
    • 3142695447 scopus 로고    scopus 로고
    • Parallel divide & conquer approach for the protein threading problem
    • N. Yanev, and R. Andonov Parallel divide & conquer approach for the protein threading problem Concurr. Comput.: Pract. Exp. 16 2004 961 974
    • (2004) Concurr. Comput.: Pract. Exp. , vol.16 , pp. 961-974
    • Yanev, N.1    Andonov, R.2
  • 14
    • 38349174488 scopus 로고    scopus 로고
    • Lagrangian approaches for a class of matching problems in computational biology
    • N. Yanev, P. Veber, R. Andonov, and S. Balev Lagrangian approaches for a class of matching problems in computational biology Comput. Math. Appl. 55 2008 1054 1067
    • (2008) Comput. Math. Appl. , vol.55 , pp. 1054-1067
    • Yanev, N.1    Veber, P.2    Andonov, R.3    Balev, S.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.