Joining softassign and dynamic programming for the contact map overlap problem

Authors:
Brijnesh J. Jain;Michael Lappe
Affiliations:
Berlin University of Technology, Faculty IV, Germany;Max Planck Inst. for Molecular Genetics, Berlin, Germany
Venue:
BIRD'07 Proceedings of the 1st international conference on Bioinformatics research and development
Year:
2007

Citing 10
Cited 1

A Graduated Assignment Algorithm for Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
An energy function and continuous edit process for graph matching

Neural Computation
101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem

RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Structural alignment of large—size proteins via lagrangian relaxation

Proceedings of the sixth annual international conference on Computational biology
Alignment Of Protein Structures With A Memetic Evolutionary Algorithm

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Algorithmic Aspects of Protein Structure Similarity

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Algorithmic aspects of protein folding and protein structure similarity

Algorithmic aspects of protein folding and protein structure similarity
Self Generating Metaheuristics in Bioinformatics: The Proteins Structure Comparison Case

Genetic Programming and Evolvable Machines
Optimal Protein Structure Alignment Using Maximum Cliques

Operations Research
A branch-and-reduce algorithm for the contact map overlap problem

RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology

Structure Spaces

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

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.