Add reference to Mo's algorithm

chapter27.tex

@@ -315,7 +315,8 @@ because both cases take a total of $O(n \sqrt n)$ time.
 
 \key{Mo's algorithm}\footnote{According to \cite{cod15}, this algorithm
 is named after Mo Tao, a Chinese competitive programmer, but
-the technique has appeared earlier in the literature.} can be used in many problems
+the technique has appeared earlier in the literature \cite{ken06}.}
+can be used in many problems
 that require processing range queries in 
 a \emph{static} array.
 Since the array is static, the queries can be

list.tex

@@ -227,15 +227,21 @@
   Efficient randomized pattern-matching algorithms.
   \emph{IBM Journal of Research and Development}, 31(2):249--260, 1987.
 
-\bibitem{kle05}
-  J. Kleinberg and É. Tardos.
-  \emph{Algorithm Design}, Pearson, 2005.
-
 \bibitem{kas61}
   P. W. Kasteleyn.  
   The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice.
   \emph{Physica}, 27(12):1209--1225, 1961.
 
+\bibitem{ken06}
+  C. Kent, G. M. Landau and M. Ziv-Ukelson.
+  On the complexity of sparse exon assembly.
+  \emph{Journal of Computational Biology}, 13(5):1013--1027, 2006.
+
+
+\bibitem{kle05}
+  J. Kleinberg and É. Tardos.
+  \emph{Algorithm Design}, Pearson, 2005.
+
 \bibitem{knu982}
   D. E. Knuth.
   \emph{The Art of Computer Programming. Volume 2: Seminumerical Algorithms}, Addison–Wesley, 1998 (3rd edition).