메뉴 건너뛰기




Volumn 55, Issue 5, 2008, Pages 1054-1067

Lagrangian approaches for a class of matching problems in computational biology

Author keywords

Cost splitting; Graph matching; Lagrangian relaxation; Network optimization; Protein threading

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; REAL TIME SYSTEMS;

EID: 38349174488     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2006.12.103     Document Type: Article
Times cited : (4)

References (13)
  • 1
    • 1242265365 scopus 로고    scopus 로고
    • Integer programming models for computational biology problems
    • Lancia G. Integer programming models for computational biology problems. Journal of Computer Science and Technology 19 (2004) 60-77
    • (2004) Journal of Computer Science and Technology , vol.19 , pp. 60-77
    • Lancia, G.1
  • 2
    • 1842451398 scopus 로고    scopus 로고
    • 1001 optimal PDB structure alignments: Integer programming methods for finding the maximum contact map overlap
    • Caprara A., Lancia G., Carr B., Walenz B., and Istrail S. 1001 optimal PDB structure alignments: Integer programming methods for finding the maximum contact map overlap. Journal of Computational Biology 11 (2004) 27-52
    • (2004) Journal of Computational Biology , vol.11 , pp. 27-52
    • Caprara, A.1    Lancia, G.2    Carr, B.3    Walenz, B.4    Istrail, S.5
  • 3
    • 0028015988 scopus 로고
    • The protein threading problem with sequence amino acid interaction preferences is N P-complete
    • Lathrop R.H. The protein threading problem with sequence amino acid interaction preferences is N P-complete. Protein Engineering 7 (1994) 1059-1068
    • (1994) Protein Engineering , vol.7 , pp. 1059-1068
    • Lathrop, R.H.1
  • 4
    • 0346967395 scopus 로고    scopus 로고
    • On the approximation of protein threading
    • Akutsu T., and Miyano S. On the approximation of protein threading. Theoretical Computer Science 210 (1999) 261-275
    • (1999) Theoretical Computer Science , vol.210 , pp. 261-275
    • Akutsu, T.1    Miyano, S.2
  • 6
    • 35048885024 scopus 로고    scopus 로고
    • Solving the protein threading problem by Lagrangian relaxation
    • Proceedings of WABI 2004: 4th Workshop on Algorithms in Bioinformatics, Springer-Verlag
    • Balev S. Solving the protein threading problem by Lagrangian relaxation. Proceedings of WABI 2004: 4th Workshop on Algorithms in Bioinformatics. LNCS/LNBI vol. 3240 (2004), Springer-Verlag 182-193
    • (2004) LNCS/LNBI , vol.3240 , pp. 182-193
    • Balev, S.1
  • 8
    • 38349120675 scopus 로고    scopus 로고
    • A. Marin, J. Pothier, K. Zimmermann, J.-F. Gibrat, Protein threading statistics: An attempt to assess the significance of a fold assignment to a sequence, in: I. Tsigelny (Ed.), Protein Structure Prediction: Bioinformatic Approach, International University Line, 2002
  • 11
    • 10044297099 scopus 로고    scopus 로고
    • Protein threading: From mathematical models to parallel implementations
    • Andonov R., Balev S., and Yanev N. Protein threading: From mathematical models to parallel implementations. INFORMS Journal on Computing 16 (2004) 393-405
    • (2004) INFORMS Journal on Computing , vol.16 , pp. 393-405
    • Andonov, R.1    Balev, S.2    Yanev, N.3
  • 12
    • 0029912991 scopus 로고    scopus 로고
    • Global optimum protein threading with gapped alignment and empirical pair potentials
    • Lathrop R.H., and Smith T.F. Global optimum protein threading with gapped alignment and empirical pair potentials. Journal of Molecular Biology 255 (1996) 641-665
    • (1996) Journal of Molecular Biology , vol.255 , pp. 641-665
    • Lathrop, R.H.1    Smith, T.F.2


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