Fast and accurate algorithms for protein side-chain packing

DOI10.1145/1162349.1162350zbMath1315.92055DBLPjournals/jacm/XuB06OpenAlexW2020530495WikidataQ57394572 ScholiaQ57394572MaRDI QIDQ3546318

Bonnie Berger, Jinbo Xu

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1162349.1162350

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Biochemistry, molecular biology (92C40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Genetics and epigenetics (92D10)

Related Items (6)

Finding geometric representations of apex graphs is NP-hard ⋮ Finding geometric representations of apex graphs is \textsf{NP}-hard ⋮ Recognizing geometric intersection graphs stabbed by a line ⋮ An exact algorithm for side-chain placement in protein design ⋮ BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design ⋮ Unnamed Item

This page was built for publication: Fast and accurate algorithms for protein side-chain packing