Joining softassign and dynamic programming for the contact map overlap problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4414 LNBI, Issue , 2007, Pages 410-423

  Jain, Brijnesh J ^a   Lappe, Michael ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b MAX PLANCK INSTITUTE FOR MOLECULAR GENETICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; GRAPH THEORY; MOLECULAR BIOLOGY; OPTIMIZATION;

CONTACT MAP OVERLAP; MAXIMUM COMMON SUBGRAPH (MCS); PROBLEM SIZE; PROTEIN STRUCTURES;

PROTEIN FOLDING;

EID: 34548082599     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-71233-6_32     Document Type: Conference Paper

References (18)

1. A. Caprara and G. Lancia. Structural alignment of large-size proteins via Lagrangianrelaxation. In RECOMB, pages 100-108, 2002.
2. A. Caprara, R. Carr, S. Istrail, G. Lancia, and Brian Walenz. 1001 optimal pdb structure alignments: Integer programming methods for finding the maximum contact map overlap. Journal of Computational Biology, 11(1):27-52, 2004.
3. R. Carr, W. Hart, N. Krasnogor, J. Hirst, E. K. Burke, and J. Smith. Alignment of protein structures with a memetic evolutionary algorithm. In GECCO 02: Proceedings of the Genetic and Evolutionary Computation Conference, pages 1027-1034, San Francisco, CA, USA, 2002.Morgan Kaufmann Publishers Inc.
4. A. M. Finch, R. C. Wilson, and E. R.Hancock. An energy function and continuous edit process for graph matching. Neural Computation, 10(7):1873-1894, 1998.
5. A. Godzik, A. Kolinski, and J. Skolnick. Topology fingerprint approach to the inverse protein folding problem. Journal of Molecular Biology, 5(1):227-238, 1992.
6. A. Godzik and J. Skolnick. Flexible algorithm for direct multiple alignment of protein structures and sequences. Computer Applications in the Biosciences, 10(6):587-596, 1994.
7. S. Gold and A.Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4):377-388, 1996.
8. D. Goldman. Algorithmic Aspects of Protein Folding and Protein Structure Similarity. PhD thesis, University of California, Berkerly, 2000.
9. D. Goldman, S. Istrail, and C. H. Papadimitriou. Algorithmic aspects of protein structure similarity. In 40th Annual Symposium on Foundations of Computer Science, pages 512-521. IEEE Computer Society, 1999.
10. L. Holm and C. Sander. Protein structure comparison by alignment of distance matrices. Journal of Molecular Biology, 233:123-138, 1993.
11. S. Ishii and M. Sato. Doubly constrained network for combinatorial optimization. Neurocomputing, 43:239-257, 2002.
12. W. Kabash. A solution for the best rotation to relate two sets of vectors. Acta Crystallographica, A32(5):922-923, 1978.
13. N. Krasnogor. Self generating metaheuristics in bioinformatics: The proteins structure comparison case. Genetic Programming and Evolvable Machines, 5(2):181-201, 2004.
14. G. Lancia, R. Carr, B. Walenz, and S. Istrail. 101 optimal pdb structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. In RECOMB 01: Proceedings of the fifth annual international conference on Computational biology, pages 193-202, NewYork, NY, USA, 2001. ACM Press.
15. M.A. Lozano and F. Escolano. A significant improvement of softassign with diffusion kernels. In A. Fred, Terry Caelli, R. P. W. Duin, A. Campilho, and D. de Ridder, editors, Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshops, SSPR 2004 and SPR 2004, volume 3138 of Lecture Notes in Computer Science, pages 76-84, 2004.
16. R. Sinkhorn. A relationship between arbitrary positive matrices and doubly stochastic matrices. Annals of Mathematical Statistics, 35(2):876-879, 1964.
17. D. M. Strickl and, E. Barnes, and J. S. Sokol. Optimal protein structure alignment using maximum cliques. Operations Research, 53(3):389-402, 2005.
18. W. Xie and N. V. Sahinidis. A branch-and-reduce algorithm for the contact map overlap problem. In A. Apostolico, C. Guerra, S. Istrail, P. Pevzner, and M. Waterman, editors, RECOMB, volume 3909 of Lecture Notes in Computer Science, pages 516-529. Springer Berlin / Heidelberg, 2006.