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.
| Originalsprache | Englisch |
|---|---|
| Seiten | 211 - 214 |
| Seitenumfang | 4 |
| Publikationsstatus | Veröffentlicht - 2011 |
| Veranstaltung | 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization - Frascati, Italien Dauer: 14.07.2011 → 16.07.2011 |
Tagung, Konferenz, Kongress
| Tagung, Konferenz, Kongress | 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization |
|---|---|
| Kurztitel | CTW 2011 |
| Land/Gebiet | Italien |
| Ort | Frascati |
| Zeitraum | 14.07.11 → 16.07.11 |