Bimal: Bipartite matching alignment for the contact map overlap problem

Proceedings of the International Joint Conference on Neural Networks

Volumn , Issue , 2009, Pages 1394-1400

  Jain, Brijnesh J ^a   Obermayer, Klaus ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE MODEL; BI-PARTITE GRAPH MATCHING; BIPARTITE MATCHINGS; COMPARATIVE STUDIES; COMPUTATION SPEED; CONTACT MAP OVERLAP; FAST METHODS; MAXIMUM CONTACT MAP OVERLAP; PAIRWISE ALIGNMENT; PROTEIN STRUCTURES; SOLUTION QUALITY;

ALIGNMENT; GRAPH THEORY; NEURAL NETWORKS; SYSTEMS ENGINEERING;

PROTEINS;

EID: 70449395306     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2009.5178901     Document Type: Conference Paper

References (19)

1. D. Barthel, J. D. Hirst, J. Blazewicz, E. K. Burke, and N. Krasnogor, "ProCKSI: a decision support system for Protein (Structure) Comparison, Knowledge, Similarity and Information", BMC Bioinformatics, vol. 8, pp. 416-457, 2007.
2. P. Bourne and H. Weissig, Structural Bioinformatics, Wiley-Liss, Inc. 2003.
3. A. Caprara and G. Lancia, "Structural Alignment of Large-Size Proteins via Lagrangian Relaxation", Proceedings of the 6th Annual International Conference on Research in Computational Molecular Biology (RECOMB'02), pp. 100-108, 2002.
4. A. Caprara, R. Carr, S. Istrail, G. Lancia, and B. Walenz, "1001 Optimal PDB Structure Alignments: Integer Programming Methods for finding the Maximum Contact Overlap", Journal of Computational Biology vol. 11, pp. 27-52, 2004.
5. R. Carr, W. Hart, N. Krasnogor, J. Hirst, E. K. Burke, and J. Smith, "Alignment of protein structures with a memetic evolutionary algorithm", Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'02), pp. 1027-1034, 2002.
6. D. Fischer, A. Elofsson, D. Rice, and D. Eisenberg, "Assessing the performance of fold recognition methods by means of a comprehensive benchmark", Proceedings of the Pacific Symposium on Biocomputing, pp. 300-318, 1996.
7. A. Godzik, J. Skolnick and A. Kolinski, "A Topology Fingerprint Approach to Inverse Protein Folding Problem", Journal of Molecular Biology., vol. 227, pp. 227-238, 1992.
8. D. Goldman, C. Papadimitrou, and S. Istrail, "Algorithmic Aspects of Protein Structure Similarity", 40th Annual Symposium on Foundations of Computer Science (FOCS'99), pp. 512-521, 1999.
9. N. Krasnogor, "Self Generating Metaheuristics in Bioinformatics: The Proteins Structure Comparison Case", enetic Programming and Evolvable Machines, vol. 5, no. 2, pp. 181-201, 2004.
10. G. Lancia, R. Carr, B. Walenz, and S. Istrail, "A Branch-and-Cut Algorithm for the Maximum Contact Map Overlap Problem", Proceedings of the 5th Annual International Conference on Research in Computational Molecular Biology (RECOMB'01), pp. 193-201, 2001.
11. R. A. Laskowski, "Structural Quality Assurance", Methods of Biochemical Analysis, vol. 44, pp. 273-304, 2003.
12. F. Malucelli, T. Ottmann, and D. Pretolani, "Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem", Discrete Applied Mathematics, vol. 47, no. 2, pp. 175-180, 1993.
13. D. A. Pelta, J. R. Gonzales, and M. M. Vega, "A Simple and Fast Heuristic for Protein Structure Comparison", BMC Bioinformatics, vol. 9, no. 1, pp. 161-176, 2008.
14. Sahinidis Optimization Group, CMOS Online Server, http://eudoxus.cheme.cmu.edu/cmos/cmos.html, Accessed 23 Sep. 2008.
15. R. Singh, J. Xu, and B. Berger, "Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology", Proceedings of the 11th Annual International Conference on Research in Computational Molecular Biology (RECOMB'01), pp. 16-31, 2007.
16. D. M. Strickland, E. Barnes and J. S. Sokol, "Optimal Protein Structure Alignment Using Maximum Cliques", Operations Research, vol. 53, no. 2, pp. 389-402, 2005.
17. W. Taylor, "Protein Structure Comparison Using Bipartite Graph Matching and its Application to Protein Structure Classification", Molecular & Cellular Proteomics, vol. 1, no. 4, pp. 334-339, 2002.
18. Y. Wang, F. Makedon, J. Ford, and H. Huang, "A bipartite graph matching framework for finding correspondences between structural elements in two proteins", Proceedings of the 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC'04), vol. 2, pp. 2972-2975, 2004.
19. W. Xie and N. V. Sahinidis, "A Reduction Based Exact Algorithm for the Contact Map Overlap Problem", Journal of Computational Biology, vol. 14, no. 5, pp. 637-654, 2007.