@inproceedings{Backofen:CPM2000,
author = {Backofen, Rolf},
title = {An Upper Bound for Number of Contacts in the
         HP-Model on the Face-Centered-Cubic Lattice (FCC)},
booktitle = {Proceedings of the 11th Annual Symposium on
             Combinatorial Pattern Matching (CPM 2000)},
year = {2000},
doi = {https://link.springer.com/chapter/10.1007/3-540-45123-4_24},
volume = {1848},
user = {backofen},
series = {LNCS},
publisher = {Springer-Verlag, Berlin},
pages = {277--292},
editor = {R. Giancarlo and D. Sankoff},
address = {Montréal, Canada},
abstract = {Lattice protein models are a major tool for
            investigating principles of protein folding. For
            this purpose, one needs an algorithm that is
            guaranteed to find the minimal energy conformation
            in some lattice model (at least for some
            sequences). So far, there are only algorithm that
            can find optimal conformations in the cubic
            lattice. In the more interesting case of the
            face-centered-cubic lattice (FCC), which is more
            protein-like, there are no results. One of the
            reasons is that for finding optimal conformations,
            one usually applies a branch-and-bound technique,
            and there are no reasonable bounds known for the
            FCC. We will give such a bound for Dill's HP-model
            on the FCC.}
}