summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAustin Ziegler <austin@zieglers.ca>2017-01-18 23:08:19 -0500
committerAustin Ziegler <austin@zieglers.ca>2017-01-18 23:08:19 -0500
commit148ffe26c27fd56a68159cbbcdb4bff81d76028a (patch)
tree4420d9cdec2f609588151870c075e9aee6faa8ba
parent8ea57621fbefa3add939e895dbeeecf2478ef868 (diff)
downloaddiff-lcs-148ffe26c27fd56a68159cbbcdb4bff81d76028a.tar.gz
Small README fix
-rw-r--r--README.rdoc4
1 files changed, 0 insertions, 4 deletions
diff --git a/README.rdoc b/README.rdoc
index 7a3350a..da410a0 100644
--- a/README.rdoc
+++ b/README.rdoc
@@ -78,7 +78,3 @@ The algorithm is described in <em>A Fast Algorithm for Computing Longest Common
Subsequences</em>, CACM, vol.20, no.5, pp.350-353, May 1977, with a few minor
improvements to improve the speed. A simplified description of the algorithm,
originally written for the Perl version, was written by Mark-Jason Dominus.
-
-:include: Contributing.rdoc
-
-:include: License.rdoc