# HG changeset patch
# User Christian Urban <urbanc@in.tum.de>
# Date 1323687671 0
# Node ID f14fa1742f36906fee3814aa470d970007151c2d
# Parent  37e9d1eb8004c6aedc352c8b1b83c3638f9c1d5a
typo

diff -r 37e9d1eb8004 -r f14fa1742f36 projects.html
--- a/projects.html	Sat Dec 10 16:07:00 2011 +0000
+++ b/projects.html	Mon Dec 12 11:01:11 2011 +0000
@@ -121,7 +121,7 @@
   suffixes and it also takes a quadratic amount of space. This is a 
   huge problem if you have to sort strings of several Megabytes or even Gigabytes,
   as happens often in biotech and DNA data mining. Suffix sorting is also a crucial operation for the 
-  <A HREF="http://en.wikipedia.org/wiki/Burrows?Wheeler_transform">Burrows-Wheeler transform</A>
+  <A HREF="http://en.wikipedia.org/wiki/Burrows-Wheeler_transform">Burrows-Wheeler transform</A>
   on which the data compression algorithm of the popular 
   <A HREF="http://en.wikipedia.org/wiki/Bzip2">bzip2</A>
   program is based.
@@ -271,7 +271,7 @@
 
 <P><!-- Created: Tue Mar  4 00:23:25 GMT 1997 -->
 <!-- hhmts start -->
-Last modified: Sat Dec 10 16:06:44 GMT 2011
+Last modified: Mon Dec 12 11:00:43 GMT 2011
 <!-- hhmts end -->
 <a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
 </BODY>