Solving the 0/1 Knapsack Problem by a Biomolecular DNA Computer

<table>Memory strand with at least <svg height="11.375" id="M87" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 73.612503 11.375" width="73.612503" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M495 86q-46 -47 -87 -72.5t-63 -25.5q-43 0 -16 107l49 210q7 34 8 50.5t-3 21t-13 4.5q-35 0 -109.5 -72.5t-115.5 -140.5q-21 -75 -38 -159q-50 -10 -76 -21l-6 8l84 340q8 35 -4 35q-17 0 -67 -46l-15 26q44 44 85.5 70.5t64.5 26.5q35 0 10 -103l-24 -98h2
q42 56 97 103.5t96 71.5q46 26 74 26q9 0 16 -2.5t14 -11.5t9.5 -24.5t-1 -44t-13.5 -68.5q-30 -117 -47 -200q-4 -19 -3.5 -25t6.5 -6q21 0 70 48z" id="x1D45B"></path></g><g transform="matrix(.017,-0,0,-.017,12.37,11.112)"><path d="M535 230h-212v-233h-58v233h-213v50h213v210h58v-210h212v-50z" id="x2B"></path></g><g transform="matrix(.017,-0,0,-.017,26.122,11.112)"><path d="M1004 650l-6 -29q-54 -6 -71 -19.5t-51 -74.5l-271 -539h-33l-98 506h-3l-258 -506h-30l-78 532q-10 67 -21.5 80t-66.5 21l6 29h241l-8 -29l-26 -5q-34 -6 -41 -16t-3 -47l59 -425h4l251 510h31l102 -510h2q150 299 198 423q14 40 8.5 48.5t-47.5 16.5l-28 5l7 29h231z
" id="x1D44A"></path></g><g transform="matrix(.017,-0,0,-.017,47.166,11.112)"><path d="M535 230h-212v-233h-58v233h-213v50h213v210h58v-210h212v-50z" id="x2B"></path></g><g transform="matrix(.017,-0,0,-.017,60.918,11.112)"><path d="M730 650l-8 -28q-52 -4 -72 -18t-64 -77q-79 -113 -321 -539h-33l-119 541q-13 59 -29.5 73t-66.5 20l7 28h245l-8 -28l-28 -5q-33 -6 -40.5 -15.5t-0.5 -38.5l102 -450h2q191 320 246 430q21 42 15.5 56t-43.5 19l-31 4l7 28h240z" id="x1D449"></path></g>
</svg> bit regions.</table>

Advances in Bioinformatics

Solving the 0/1 Knapsack Problem by a Biomolecular DNA Computer

Figure 3