Solving maximum clique problem for protein structure similarity

MaRDI QIDQ3002929zbMATH OpenFDO

Authors Noël Malod-Dognin, Rumen Andonov, Nicolas Yanev

Publication date 24 May 2011

Full work available at URL https://arxiv.org/abs/0901.4833, https://eudml.org/doc/11378

zbMATH Keywords

\(k\)-partite graphsbranch and boundinteger programmingmaximum cliqueprotein structure comparison

Mathematics Subject Classification ID

Integer programming (90C10) Protein sequences, DNA sequences (92D20)

Recommendations

• Optimal Protein Structure Alignment Using Maximum Cliques
• A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem
• scientific article; zbMATH DE number 5997363
• Clique-detection models in computational biochemistry and genomics
• A finding maximal clique algorithm for predicting loop of protein structure

Cited in

(7)

• Automatic classification of protein structure using the maximum contact map overlap metric
• Clique-detection models in computational biochemistry and genomics
• QUBO formulation for the contact map overlap problem
• Optimal Protein Structure Alignment Using Maximum Cliques
• scientific article; zbMATH DE number 2239324 (Why is no real title available?)
• Algorithm engineering for optimal alignment of protein structure distance matrices
• A finding maximal clique algorithm for predicting loop of protein structure

Describes a project that uses

Uses Software

• QUALEX

This page was built for publication: Solving maximum clique problem for protein structure similarity

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