Joining softassign and dynamic programming for the contact map overlap problem

Brijnesh, J. Jain; Lappe, Michael

doi:10.1007/978-3-540-71233-6_32

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Proceedings

Joining softassign and dynamic programming for the contact map overlap problem

MPS-Authors

/persons/resource/persons50406

Lappe, Michael
Independent Junior Research Groups (OWL), Max Planck Institute for Molecular Genetics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Brijnesh, J. J., & Lappe, M. (2007). Joining softassign and dynamic programming for the contact map overlap problem. Berlin; Heidelberg: Springer Berlin / Heidelberg.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-82EB-D

Abstract

Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structure similarity. Maximizing CMO is, however, NP-hard. To approximately solve CMO, we combine softassign and dynamic programming. Softassign approximately solves the maximum common subgraph (MCS) problem. Dynamic programming converts the MCS solution to a solution of the CMO problem. We present and discuss experiments using proteins with up to 1500 residues. The results indicate that the proposed method is extremely fast compared to other methods, scales well with increasing problem size, and is useful for comparing similar protein structures.