Comets (Constrained Optimization of Multistate Energies by Tree Search): A Provable and Efficient Algorithm to Optimize Binding Affinity and Specificity with Respect to Sequence

Mark Hallen, Bruce Randall Donald. Comets (Constrained Optimization of Multistate Energies by Tree Search): A Provable and Efficient Algorithm to Optimize Binding Affinity and Specificity with Respect to Sequence. In Teresa M. Przytycka, editor, Research in Computational Molecular Biology - 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings. Volume 9029 of Lecture Notes in Computer Science, pages 122-135, Springer, 2015. [doi]

@inproceedings{HallenD15,
  title = {Comets (Constrained Optimization of Multistate Energies by Tree Search): A Provable and Efficient Algorithm to Optimize Binding Affinity and Specificity with Respect to Sequence},
  author = {Mark Hallen and Bruce Randall Donald},
  year = {2015},
  doi = {10.1007/978-3-319-16706-0_14},
  url = {http://dx.doi.org/10.1007/978-3-319-16706-0_14},
  researchr = {https://researchr.org/publication/HallenD15},
  cites = {0},
  citedby = {0},
  pages = {122-135},
  booktitle = {Research in Computational Molecular Biology - 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings},
  editor = {Teresa M. Przytycka},
  volume = {9029},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-16705-3},
}