Algorithm 1. Heuristic DNA property selection.

Input: Universal set $U=\{P_1,P_2,\dots ,P_N\}$ Output: Optimized property set S

1.  $S\leftarrow \varnothing$ 2.  $\mathrm{Acc}(S)\leftarrow 0$      $\mathrm{Acc}(S)$ is the accuracy corresponding to S 3.  while $U\backslash S\ne \varnothing$ do 4.    for each property $P_{i_k}\in U\backslash S$ do 5.    generating a candidate set $S_{i_k}\leftarrow S\cup \left\{P_{i_k}\right\}$ 6.    calculating $\mathrm{Acc}(S_{i_k})$ 7.    end for 8.    $i*\leftarrow \underset{i_k}{\arg \max }\{\mathrm{Acc}(S_{i_k})\}$ 9.    if $\mathrm{Acc}(S_{i*})\ge \mathrm{Acc}(S)$ do 10.   $S\leftarrow S_{i*}$ 11.   $\mathrm{Acc}(S)\leftarrow \mathrm{Acc}(S_{i*})$ 12.   else 13.   break while 14.   end if 15.   end while 16. return S