Sparsifying distance matrices for protein-protein structure alignments

Antonio Mucherino; Inken Wohlers; Gunnar W. Klau; Rumen Andonov

Sparsifying distance matrices for protein-protein structure alignments

Antonio Mucherino, Inken Wohlers, Gunnar W. Klau, Rumen Andonov

Clinic of Neurology

Abstract

The problem of finding similarities between native protein conformations can be formulated as the problem of aligning inter-residue distance matrices. Recently proposed exact algorithms are able to solve this problem for large proteins only if the considered distance matrices are sparse. We propose a strategy for sparsifying distance matrices in which we keep the distances needed for uniquely reconstructing the conformations of the proteins.

Original language	English
Pages	211 - 214
Number of pages	4
Publication status	Published - 2011
Event	10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization - Frascati, Italy Duration: 14.07.2011 → 16.07.2011

Conference

Conference	10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Abbreviated title	CTW 2011
Country/Territory	Italy
City	Frascati
Period	14.07.11 → 16.07.11

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Cite this

@conference{255813d926fb44cbb427c151605e87ac,

title = "Sparsifying distance matrices for protein-protein structure alignments",

abstract = "The problem of finding similarities between native protein conformations can be formulated as the problem of aligning inter-residue distance matrices. Recently proposed exact algorithms are able to solve this problem for large proteins only if the considered distance matrices are sparse. We propose a strategy for sparsifying distance matrices in which we keep the distances needed for uniquely reconstructing the conformations of the proteins.",

author = "Antonio Mucherino and Inken Wohlers and Klau, \{Gunnar W.\} and Rumen Andonov",

year = "2011",

language = "English",

pages = "211 -- 214",

note = "10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization , CTW 2011 ; Conference date: 14-07-2011 Through 16-07-2011",

}

TY - CONF

T1 - Sparsifying distance matrices for protein-protein structure alignments

AU - Mucherino, Antonio

AU - Wohlers, Inken

AU - Klau, Gunnar W.

AU - Andonov, Rumen

PY - 2011

Y1 - 2011

N2 - The problem of finding similarities between native protein conformations can be formulated as the problem of aligning inter-residue distance matrices. Recently proposed exact algorithms are able to solve this problem for large proteins only if the considered distance matrices are sparse. We propose a strategy for sparsifying distance matrices in which we keep the distances needed for uniquely reconstructing the conformations of the proteins.

AB - The problem of finding similarities between native protein conformations can be formulated as the problem of aligning inter-residue distance matrices. Recently proposed exact algorithms are able to solve this problem for large proteins only if the considered distance matrices are sparse. We propose a strategy for sparsifying distance matrices in which we keep the distances needed for uniquely reconstructing the conformations of the proteins.

UR - http://www.scopus.com/inward/record.url?scp=84883066179&partnerID=8YFLogxK

M3 - Conference Papers

SP - 211

EP - 214

T2 - 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization

Y2 - 14 July 2011 through 16 July 2011

ER -

Sparsifying distance matrices for protein-protein structure alignments

Abstract

Conference

UN SDGs

Other files and links

Fingerprint

Cite this