Skip to main content
. 2003 Jul;85(1):174–190. doi: 10.1016/S0006-3495(03)74464-6

FIGURE 7.

FIGURE 7

Information content dependence on number of constraints. I(Mgreedy) was calculated using a greedy algorithm for N = 12. Seventeen distance constraints are required to obtain IM by this method. (a) I(Mgreedy) versus number of distances, |M|. The continuous line serves only to guide the eye. Dashed line I(Mrandom), averaged over 100 random constraint sets per |M|, with standard deviation given by upper/lower bars. (b) The greedy algorithm choices for |M| = 17 and N = 12 plotted by i,j identity.