A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem

DOI10.1007/11732990_43MaRDI QIDQ3596288zbMATH OpenOpenAlexFDO

Authors Wei Xie, Nikolaos V. Sahinidis

Publication date 30 August 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11732990_43

zbMATH Keywords

combinatorial optimizationcontact map overlap\({\mathcal{NP}}\)-hard problemprotein clusters

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Combinatorial optimization (90C27)

Recommendations

• On protein structure alignment under distance constraint
• On protein structure alignment under distance constraint
• scientific article; zbMATH DE number 2130513
• Optimal Protein Structure Alignment Using Maximum Cliques
• A fuzzy sets based generalization of contact maps for the overlap of protein structures

Cited in

(6)

• scientific article; zbMATH DE number 2130513 (Why is no real title available?)
• A fuzzy sets based generalization of contact maps for the overlap of protein structures
• Optimal Protein Structure Alignment Using Maximum Cliques
• On protein structure alignment under distance constraint
• On protein structure alignment under distance constraint
• Solving maximum clique problem for protein structure similarity

Describes a project that uses

Uses Software

• BALL

This page was built for publication: A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596288)