BBK* (Branch and Bound over K*): A Provable and Efficient Ensemble-Based Algorithm to Optimize Stability and Binding Affinity over Large Sequence Spaces.
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/recomb/OjewoleJFD17
%A Ojewole, Adegoke A.
%A Jou, Jonathan D.
%A Fowler, Vance G.
%A Donald, Bruce Randall
%B RECOMB
%D 2017
%E Sahinalp, Süleyman Cenk
%K dblp
%P 157-172
%T BBK* (Branch and Bound over K*): A Provable and Efficient Ensemble-Based Algorithm to Optimize Stability and Binding Affinity over Large Sequence Spaces.
%U http://dblp.uni-trier.de/db/conf/recomb/recomb2017.html#OjewoleJFD17
%V 10229
%@ 978-3-319-56970-3
@inproceedings{conf/recomb/OjewoleJFD17,
added-at = {2022-08-23T00:00:00.000+0200},
author = {Ojewole, Adegoke A. and Jou, Jonathan D. and Fowler, Vance G. and Donald, Bruce Randall},
biburl = {https://www.bibsonomy.org/bibtex/2e5432afe0874351b1f54a9e7324811a0/dblp},
booktitle = {RECOMB},
crossref = {conf/recomb/2017},
editor = {Sahinalp, Süleyman Cenk},
ee = {https://doi.org/10.1007/978-3-319-56970-3_10},
interhash = {0e42ffbcb74624938e7f5c5daf3cd2f7},
intrahash = {e5432afe0874351b1f54a9e7324811a0},
isbn = {978-3-319-56970-3},
keywords = {dblp},
pages = {157-172},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-10T03:50:35.000+0200},
title = {BBK* (Branch and Bound over K*): A Provable and Efficient Ensemble-Based Algorithm to Optimize Stability and Binding Affinity over Large Sequence Spaces.},
url = {http://dblp.uni-trier.de/db/conf/recomb/recomb2017.html#OjewoleJFD17},
volume = 10229,
year = 2017
}
