diff -r c7ff53dd9d09 -r e978feb5651a projects.html
--- a/projects.html	Fri Jan 06 18:44:54 2012 +0000
+++ b/projects.html	Wed Jan 11 17:17:43 2012 +0000
@@ -152,7 +152,12 @@
 
   <p>
   <B>Literature:</B> A good starting point for reading about suffix sorting is the 
-  <A HREF="http://books.google.co.uk/books?id=Pn1sHToYf9oC&printsec=frontcover&source=gbs_ge_summary_r&cad=0#v=onepage&q&f=false">book</A> by Crochemore. Two simple algorithms are also described
+  <A HREF="http://books.google.co.uk/books?id=Pn1sHToYf9oC&printsec=frontcover&source=gbs_ge_summary_r&cad=0#v=onepage&q&f=false">book</A> by Crochemore. 
+  Another good introduction is 
+  <A HREF="http://people.unipmn.it/manzini/papers/esa02.pdf">here</A>, 
+  which gives also good pointers for why efficient suffix sorting
+  is practically relevant.
+  Two simple algorithms are described
   <A HREF="http://ls11-www.cs.uni-dortmund.de/people/rahmann/teaching/ss2008/AlgorithmenAufSequenzen/09-walk-bwt.pdf">here</A>. The main literature is the 12-page
   <A HREF="http://www.cs.rutgers.edu/~muthu/fm072.pdf">article</A> about in-place
   suffix sorting. The Burrows-Wheeler data compression is described 
@@ -301,7 +306,7 @@
 
 <P><!-- Created: Tue Mar  4 00:23:25 GMT 1997 -->
 <!-- hhmts start -->
-Last modified: Sun Dec 25 18:04:46 GMT 2011
+Last modified: Wed Jan 11 16:30:03 GMT 2012
 <!-- hhmts end -->
 <a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
 </BODY>