Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem

@inproceedings{Jain2007JoiningSA,
  title={Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem},
  author={Brijnesh J. Jain and Michael Lappe},
  booktitle={BIRD},
  year={2007}
}
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… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS