메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1762-1768

A parallel BP algorithm for the discretizable distance geometry problem

Author keywords

branch and prune; discretization; distance geometry; parallel computing

Indexed keywords

BP ALGORITHM; BRANCH-AND-PRUNE; COMMON COORDINATE SYSTEMS; COMPUTATIONAL EXPERIMENT; DISCRETIZATIONS; DISTANCE GEOMETRY; PARALLEL VERSION; VERTEX SET;

EID: 84867435730     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2012.218     Document Type: Conference Paper
Times cited : (6)

References (30)
  • 3
    • 55549138762 scopus 로고    scopus 로고
    • A distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
    • P. Biswas, K.C. Toh, and Y. Ye, A distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation, SIAM Journal on Scientific Computing 30, 1251-1277, 2008.
    • (2008) SIAM Journal on Scientific Computing , vol.30 , pp. 1251-1277
    • Biswas, P.1    Toh, K.C.2    Ye, Y.3
  • 4
    • 79961088503 scopus 로고    scopus 로고
    • Locally Optimal Heuristic for Modularity Maximization of Networks
    • S. Cafieri, P. Hansen, L. Liberti, Locally Optimal Heuristic for Modularity Maximization of Networks, Physical Review E 83:056105, 2011.
    • (2011) Physical Review E , vol.83 , pp. 056105
    • Cafieri, S.1    Hansen, P.2    Liberti, L.3
  • 5
    • 77950934337 scopus 로고    scopus 로고
    • Loops and Multiple Edges in Modularity Maximization of Networks
    • S. Cafieri, P. Hansen, L. Liberti, Loops and Multiple Edges in Modularity Maximization of Networks, Physical Review E 81:046102, 2010.
    • (2010) Physical Review E , vol.81 , pp. 046102
    • Cafieri, S.1    Hansen, P.2    Liberti, L.3
  • 6
    • 14044262230 scopus 로고    scopus 로고
    • Reliable Computation of the Points of Intersection of n Spheres in n-space
    • I.D. Coope, Reliable Computation of the Points of Intersection of n Spheres in n-space, ANZIAM Journal 42, 461-477, 2000.
    • (2000) ANZIAM Journal , vol.42 , pp. 461-477
    • Coope, I.D.1
  • 8
    • 84867962761 scopus 로고    scopus 로고
    • A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data
    • Q. Dong and Z. Wu, A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data, Journal of Global Optimization, 26, 321-333, 2003.
    • (2003) Journal of Global Optimization , vol.26 , pp. 321-333
    • Dong, Q.1    Wu, Z.2
  • 9
    • 33847302188 scopus 로고
    • Distance Geometry
    • D.M. Grant and R.K. Harris (Eds.), Wiley, New York
    • T.F. Havel, Distance Geometry, D.M. Grant and R.K. Harris (Eds.), Encyclopedia of Nuclear Magnetic Resonance, Wiley, New York, 1701-1710, 1995.
    • (1995) Encyclopedia of Nuclear Magnetic Resonance , pp. 1701-1710
    • Havel, T.F.1
  • 10
    • 77956091432 scopus 로고    scopus 로고
    • Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
    • N. Krislock, H. Wolkowicz, Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions, SIAM Journal on Optimization 20, 2679-2708, 2010.
    • (2010) SIAM Journal on Optimization , vol.20 , pp. 2679-2708
    • Krislock, N.1    Wolkowicz, H.2
  • 15
    • 84929611095 scopus 로고    scopus 로고
    • The interval Branch-and-Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances
    • to appear
    • C. Lavor, L. Liberti, A. Mucherino, The interval Branch-and-Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances, to appear in Journal of Global Optimization, 2012.
    • (2012) Journal of Global Optimization
    • Lavor, C.1    Liberti, L.2    Mucherino, A.3
  • 17
    • 79955868839 scopus 로고    scopus 로고
    • On the Computation of Protein Backbones by using Artificial Backbones of Hydrogens
    • C. Lavor, A. Mucherino, L. Liberti, N. Maculan, On the Computation of Protein Backbones by using Artificial Backbones of Hydrogens, Journal of Global Optimization, 50, 329-344, 2011.
    • (2011) Journal of Global Optimization , vol.50 , pp. 329-344
    • Lavor, C.1    Mucherino, A.2    Liberti, L.3    Maculan, N.4
  • 22
    • 80051984860 scopus 로고    scopus 로고
    • On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
    • th Annual International Conference on Combinatorial Optimization and Applications (COCOA11), Zhangjiajie, China
    • th Annual International Conference on Combinatorial Optimization and Applications (COCOA11), Zhangjiajie, China, 322-342, 2011.
    • (2011) Lecture Notes in Computer Science , vol.6831 , pp. 322-342
    • Liberti, L.1    Masson, B.2    Lee, J.3    Lavor, C.4    Mucherino, A.5
  • 23
    • 68749099796 scopus 로고    scopus 로고
    • Multi-level Algorithms for Modularity Clustering
    • A. Noack, R. Rotta, Multi-level Algorithms for Modularity Clustering, Lecture Notes in Computer Science 5526, 257-268, 2009.
    • (2009) Lecture Notes in Computer Science , vol.5526 , pp. 257-268
    • Noack, A.1    Rotta, R.2
  • 26
    • 79955851810 scopus 로고    scopus 로고
    • Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems
    • P.M. Pardalos and S. Rebennack (Eds.), Proceedings of the 10th International Symposium on Experimental Algorithms (SEA11), Crete, Greece
    • A. Mucherino, C. Lavor, T. Malliavin, L. Liberti, M. Nilges, M. Maculan, Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems, Lecture Notes in Computer Science 6630, P.M. Pardalos and S. Rebennack (Eds.), Proceedings of the 10th International Symposium on Experimental Algorithms (SEA11), Crete, Greece, 206-217, 2011.
    • (2011) Lecture Notes in Computer Science , vol.6630 , pp. 206-217
    • Mucherino, A.1    Lavor, C.2    Malliavin, T.3    Liberti, L.4    Nilges, M.5    Maculan, M.6
  • 27
    • 78149236724 scopus 로고    scopus 로고
    • MD-jeep: An Implementation of a Branch & Prune Algorithm for Distance Geometry Problems
    • K. Fukuda et al. (Eds.), Proceedings of the Third International Congress on Mathematical Software (ICMS10), Kobe, Japan
    • A. Mucherino, L. Liberti, C. Lavor, MD-jeep: an Implementation of a Branch & Prune Algorithm for Distance Geometry Problems, Lectures Notes in Computer Science 6327, K. Fukuda et al. (Eds.), Proceedings of the Third International Congress on Mathematical Software (ICMS10), Kobe, Japan, 186-197, 2010.
    • (2010) Lectures Notes in Computer Science , vol.6327 , pp. 186-197
    • Mucherino, A.1    Liberti, L.2    Lavor, C.3
  • 28
    • 0023998438 scopus 로고
    • Determination of Three-Dimensional Structures of Proteins by Simulated Annealing with Interproton Distance Restraints. Application to Crambin, Potato Carboxypeptidase Inhibitor and Barley Serine Proteinase Inhibitor 2
    • M. Nilges, A.M. Gronenborn, A.T. Brunger, G.M. Clore, Determination of Three-Dimensional Structures of Proteins by Simulated Annealing with Interproton Distance Restraints. Application to Crambin, Potato Carboxypeptidase Inhibitor and Barley Serine Proteinase Inhibitor 2, Protein Engineering 2, 27-38, 1988.
    • (1988) Protein Engineering , vol.2 , pp. 27-38
    • Nilges, M.1    Gronenborn, A.M.2    Brunger, A.T.3    Clore, G.M.4
  • 30
    • 43249103721 scopus 로고    scopus 로고
    • Rigid Versus Unique Determination of Protein Structures with Geometric Buildup
    • D. Wu, Z. Wu, Y. Yuan, Rigid Versus Unique Determination of Protein Structures with Geometric Buildup, Optimization Letters 2, 319-331, 2008.
    • (2008) Optimization Letters , vol.2 , pp. 319-331
    • Wu, D.1    Wu, Z.2    Yuan, Y.3


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