Various bioinformatics problems require optimizing several different properties simultaneously. For example, in the protein threading problem, a linear scoring function combines the values for different properties of possible sequence-to-structure alignments into a single score to allow for unambiguous optimization. In this context, an essential question is how each property should be weighted. As the native structures are known for some sequences, the implied partial ordering on optimal alignments may be used to adjust the weights. To resolve the arising interdependence of weights and computed solutions, we propose a novel approach: iterating the computation of solutions (here: threading alignments) given the weights and the estimation of optimal weights of the scoring function given these solutions via a systematic calibration method. We show that this procedure converges to structurally meaningful weights, that also lead to significantly improved performance on comprehensive test data sets as measured in different ways. The latter indicates that the performance of threading can be improved in general.
CITATION STYLE
Zien, A., Zimmer, R., & Lengauer, T. (2000). Simple iterative approach to parameter optimization. In Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB (pp. 318–327). ACM. https://doi.org/10.1145/332306.332570
Mendeley helps you to discover research relevant for your work.