README updates

Author: leea

README.md

@@ -34,14 +34,17 @@ element is returned.
 
 diff-cpp implements the Longest Common Subsequence algorithm described
 by Eugene Myers[1] with the divide and conquer linear space refinement
-described by Hirshberg[2].  This algorithm is highly performant - with
-sequence lengths near 10,000 and SES length around 10%, this algorithm
-typically finishes under 10ms my test system (1.8Ghz Core2
+described by Hirshberg[2], and optimizations from Neil Fraser's
+diff-patch-match library[3]. The final algorithm is highly performant -
+with sequence lengths near 10,000 and SES length around 10%, this
+algorithm typically finishes under 10ms my test system (1.8Ghz Core2
 Duo).
 
 [1] An O(ND) Difference Algorithm and Its Variations.  Eugene
 Myers. Algorithmica 1986
 
 [2] A Linear Space Algorithm for Computing Maximal Common
 Subsequences. Dan S. Hirshberg. Communications of the ACM. 1975
-Vol. 18 No. 6
+Vol. 18 No. 6
+
+[3] Google-diff-patch-match. https://code.google.com/p/google-diff-match-patch/

test/test_diff.cpp

@@ -6,7 +6,6 @@
 #include <ctime>
 
 #include "lcs.h"
-//#include "Difference.h"
 
 using std::vector;
 using std::cout;