deletions | additions       diff --git a/subsection_Comparision_algorithm_For_comparing__.tex b/subsection_Comparision_algorithm_For_comparing__.tex  index 64583b8..dc482ce 100644  --- a/subsection_Comparision_algorithm_For_comparing__.tex  +++ b/subsection_Comparision_algorithm_For_comparing__.tex 
...
\subsection{Coding}  In this section we talk about coding schema and its role in our algorithm. In our storage layout we describe how we are saving our data in vertical fashion. But how we can interpret this layout and use it to improve our performance.\\  In storage layout we suggest to use below coding: coding:\\  IMAGE, IMAGE, IMAGE    If we just look at highest bit of the characters in this coding we have: 
...
Thus we can recognize T out of other three characters A, C, G with looking at only their highest bit, since T is the only character which its highest bit is 1. The same would happen in their middle bits. Because of our coding schema we can recognize C and G out of A and T. Since, C and G's middle bit is 1 but A and T's middle bit is 0.\\  Base on above observation and our algorithm we can infer an important point. With suggested coding schema at first step (comparing highest bits) we are able to recognizing all substitution of T with A, C and G with only comparing highest bit of our character. In fact, our final output for highest bit is an vector of 0s and 1s which telling us at which location substitution of T with A, C and G have been happened.