Multiple alignment of contact maps

Authors:
Brijnesh J. Jain;Henning Stehr;Michael Lappe;Klaus Obermayer
Affiliations:
Department of Electrical Engineering and Computer Science, Berlin University of Technology, Germany;Max Planck Institute for Molecular Genetics, Berlin, Germany;Max Planck Institute for Molecular Genetics, Berlin, Germany;Department of Electrical Engineering and Computer Science, Berlin University of Technology, Germany
Venue:
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Year:
2009

Citing 4
Cited 2

Algorithmic Aspects of Protein Structure Similarity

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Multiple flexible structure alignment using partial order graphs

Bioinformatics
A new progressive-iterative algorithm for multiple structure alignment

Bioinformatics
Bimal: bipartite matching alignment for the contact map overlap problem

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks

Structure Spaces

The Journal of Machine Learning Research
Large sample statistics in the domain of graphs

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that multiple structure alignment (MStA) using contact maps is equivalent to the problem of fnding a sample mean of contact maps. From this result, we derive a subgradient method for solving the MStA method. Experiments show that the proposed algorithm is a f exible alignment method that provides an excellent tradeoff between accuracy and speed.