Approximate Counting with Deterministic Guarantees for Affinity Computation

DOI10.1007/978-3-319-18167-7_15zbMath1370.90230OpenAlexW1148521011MaRDI QIDQ5357750

David Allouche, Sophie Barbe, Clément Viricel, Thomas Schiex, Simon de Givry, David Simoncini

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18167-7_15

zbMATH Keywords

constraint programmingcost function networkcounting problemssoft arc consistencycomputational protein designprotein-ligand affinityweighted \#CSP

Mathematics Subject Classification ID

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

Uses Software

• AMBER
• Osprey

Cites Work

• Unnamed Item
• Unnamed Item
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Soft arc consistency revisited
• Reasoning from last conflict(s) in constraint programming
• Computational protein design as an optimization problem
• Local Consistency in Weighted CSPs and Inference in Max-SAT
• Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams

This page was built for publication: Approximate Counting with Deterministic Guarantees for Affinity Computation