PMC:1459172 / 12464-13204 JSONTXT

{"project":"2_test","denotations":[{"id":"16722605-1695107-1692558","span":{"begin":528,"end":530},"obj":"1695107"}],"text":"The F table is initialized as Fi+1, i = 0, while the other tables are are set to infinity for empty intervals. It is straightforward to translate these recursions into recursions for the partition function because they already provide a partition of the set of all secondary structures that can be formed by the sequence x. This unambiguity of the decomposition of the ensemble structure is not important for energy minimization, while it is crucial for enumeration and hence also for the computation of the partition function [31]. Let us write Zij for the partition function on [xi, xj]. for the partition function constrained to structures with an (i, j) pair, and , for the partition function versions of the multiloop terms Mij and ."}