Algorithm 2$\beta$-step Algorithm

for $k=0$; $k<|in{d}_i|$; k++ do   if $in{d}_i\left[k\right]!=in{d}_j\left[k\right]$ then    put k into the list $index$;   end if  end for  $totalNum=round(rand(0,1)\times Hamming(in{d}_i,in{d}_j))$;  $num=0$;  $n=0$;  while $num<totalNum$ do   if $rand(0,1)<\frac{{\beta }_0}{1+\gamma r_{ij}^2}$ then    $in{d}_i\left[index\left[n\right]\right]=(in{d}_i\left[index\left[n\right]\right]+1)mod2$;    remove $index\left[n\right]$ from $index$;    $num=num+1$;   end if   $n=(n+1)modindex.length\left(\right)$;  end while