mark typo in discussion

bioinformatics.tex

@@ -1078,8 +1078,8 @@ \section{Conclusion}
 We have developed a novel algorithm for interval intersection that
 is uniquely suited to scalable computing architectures such as GPUs.
 Our algorithm takes a new approach to counting intersections: 
-unlike existing methods that must enumerate intersection in order to 
-derive a count, BITS uses two binary searches to directly infer the 
+unlike existing methods that must enumerate \textcolor{red}{intersections}
+in order to derive a count, BITS uses two binary searches to directly infer the 
 count by excluding intervals that \emph{cannot} intersect one another. 
 
 We have demonstrated that a sequential implementation of BITS outperforms