A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem (Q3596288)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem |
scientific article; zbMATH DE number 5185131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem |
scientific article; zbMATH DE number 5185131 |
Statements
A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem (English)
0 references
30 August 2007
0 references
contact map overlap
0 references
\({\mathcal{NP}}\)-hard problem
0 references
combinatorial optimization
0 references
protein clusters
0 references
0.8120803833007812
0 references
0.8093692064285278
0 references
0.7904331088066101
0 references
0.7744198441505432
0 references
