deletions | additions       diff --git a/subsection_Comparision_algorithm_For_comparing__.tex b/subsection_Comparision_algorithm_For_comparing__.tex  index 3da8af3..b274472 100644  --- a/subsection_Comparision_algorithm_For_comparing__.tex  +++ b/subsection_Comparision_algorithm_For_comparing__.tex 
...
Since we are coding our base pairs with three bits, we should do XOR for each level separately and then accumulate our final result with applying OR operation on all results. With this approach our final result would be a word processor which each of its bit will tell us whether two \textit{bp}s from two different strings matched or not. Next step would be computing number of miss matches between two strings. Since we have segmented our string into multiple segments for the last step we need to sum up each segment's result and then compare it with the user defined threshold \textit{e}. Figure \ref{fig:fig3} shows following procedure.    \begin{figure}  \includegraphics[\width=\linewidth]{figures/Untitled2} \includegraphics[\width=\linewidth]{figures/Untitled2.png}  \end{figure}  \subsection{Filtering} 
...