QPSO-Based Adaptive DNA Computing Algorithm

<table class="table-group" id="tab2"><tr><td><table class="table"><tr><td class="thead-hr" colspan="5"><hr/></td></tr><tr class="thead"><td align="left">Algorithm</td><td align="center"><span style="width: 21px;"><svg height="18.3125" id="M47" style="vertical-align:-5.73167pt" version="1.1" viewbox="0 0 21 18.3125" width="21" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M764 650l-7 -26q-61 -10 -91.5 -22.5t-76.5 -48.5l-235 -184q104 -152 208 -276q31 -37 54.5 -48.5t68.5 -16.5l-7 -28h-156q-138 170 -213 284q-19 29 -33.5 35t-33.5 -7l-29 -173q-15 -75 -5.5 -90.5t74.5 -20.5l-5 -28h-260l7 28q58 5 74 21.5t30 89.5l70 378
q12 68 2 83t-72 22l6 28h257l-7 -28q-62 -7 -76 -21.5t-27 -83.5l-32 -172q29 11 78 46q112 84 217 179q18 16 23.5 25.5t-1 14.5t-26.5 8l-30 4l5 28h249z" id="x1D43E"></path></g>
<g transform="matrix(.012,-0,0,-.012,13.25,15.188)"><path d="M570 304q0 -108 -87 -199q-40 -42 -94.5 -74t-105.5 -43q-41 0 -65 11l-29 -141q-9 -45 -1.5 -58t45.5 -16l26 -2l-5 -29l-241 -10l4 26q51 10 67.5 24t26.5 60l113 520q-54 -20 -89 -41l-7 26q38 28 105 53l11 49q20 25 77 58l8 -7l-17 -77q39 14 102 14q82 0 119 -36
t37 -108zM482 289q0 114 -113 114q-26 0 -66 -7l-70 -327q12 -14 32 -25t39 -11q59 0 118.5 81.5t59.5 174.5z" id="x1D45D"></path></g>
</svg></span></td><td align="center"><span style="width: 17.1875px;"><svg height="15.4" id="M48" style="vertical-align:-3.3907pt" version="1.1" viewbox="0 0 17.1875 15.4" width="17.1875" 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="M764 650l-7 -26q-61 -10 -91.5 -22.5t-76.5 -48.5l-235 -184q104 -152 208 -276q31 -37 54.5 -48.5t68.5 -16.5l-7 -28h-156q-138 170 -213 284q-19 29 -33.5 35t-33.5 -7l-29 -173q-15 -75 -5.5 -90.5t74.5 -20.5l-5 -28h-260l7 28q58 5 74 21.5t30 89.5l70 378
q12 68 2 83t-72 22l6 28h257l-7 -28q-62 -7 -76 -21.5t-27 -83.5l-32 -172q29 11 78 46q112 84 217 179q18 16 23.5 25.5t-1 14.5t-26.5 8l-30 4l5 28h249z" id="x1D43E"></path></g>
<g transform="matrix(.012,-0,0,-.012,13.25,15.187)"><path d="M244 607q0 -25 -15.5 -43t-37.5 -18q-19 0 -32 13t-13 35q0 21 15 41t39 20q20 0 32 -14t12 -34zM222 91q-29 -33 -79 -68t-75 -35q-13 0 -19 7.5t-6 31t10 65.5l62 253q5 26 -1 26q-21 0 -72 -43l-13 24q43 40 91 68t71 28q30 0 10 -78l-71 -274q-8 -30 3 -30
q16 0 76 48z" id="x1D456"></path></g>
</svg></span></td><td align="center">Settling time</td><td align="center">Overshoot %</td></tr><tr><td class="thead-hr" colspan="5"><hr/></td></tr><tr><td align="left">DNA-PI</td><td align="center">30</td><td align="center">0.1250</td><td align="center">0.08</td><td align="center">14</td></tr><tr><td align="left">Adaptive DNA-PI</td><td align="center">17</td><td align="center">0.4375</td><td align="center">0.08</td><td align="center">~0</td></tr><tr class="table-tr"><td colspan="5"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Comparison results of DNA and adaptive DNA computing algorithms.

The Scientific World Journal

tab2

Table 2

Table 2: QPSO-Based Adaptive DNA Computing Algorithm 