deletions | additions       diff --git a/section_Suggestions_Following_section_is__.tex b/section_Suggestions_Following_section_is__.tex  index 2f0353f..7e6f6f6 100644  --- a/section_Suggestions_Following_section_is__.tex  +++ b/section_Suggestions_Following_section_is__.tex 
...
\end{enumerate}    \subsection{New filter}  With considering all above facts we can suggest a filter. In suggested filter we can just compare limited number of highest bit of our reads and filter out big portion of them without doing full computation \emph{full computation}  andeven  without transfering \emph{transferring  large portion portion}  of our data. For tuning our filter we need to find a good balance point between following parameters:  \begin{enumerate}  \item Data level parallelism. How many reads we are going to compare in a same time? Our word processor's size is limited but we can choose number of reads we are going to load into a word processor with varying number of \underline{bits per reads}.  \end{enumerate}