diff --git a/DESCRIPTION b/DESCRIPTION
index bb367f6..a653c8d 100644
--- a/DESCRIPTION
+++ b/DESCRIPTION
@@ -1,20 +1,22 @@
 Package: RANN
-Title: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric
-Author: Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis
+Title: Fast Nearest Neighbour Search (Wraps ANN Library) Using
+    L2 Metric
+Version: 2.6.1
+Author: Sunil Arya and David Mount (for ANN), Samuel E. Kemp,
+    Gregory Jefferis
 Maintainer: Gregory Jefferis <jefferis@gmail.com>
-Copyright: ANN library is copyright University of Maryland and Sunil Arya and
-    David Mount. See file COPYRIGHT for details.
-Description: Finds the k nearest neighbours for every point in a given dataset
-    in O(N log N) time using Arya and Mount's ANN library (v1.1.3). There is
-    support for approximate as well as exact searches, fixed radius searches
-    and 'bd' as well as 'kd' trees. The distance is computed using the L2
-    (Euclidean) metric. Please see package 'RANN.L1' for the same
-    functionality using the L1 (Manhattan, taxicab) metric.
+Description: Finds the k nearest neighbours for every point in a
+    given dataset in O(N log N) time using Arya and Mount's ANN library
+    (v1.1.3). There is support for approximate as well as exact searches,
+    fixed radius searches and 'bd' as well as 'kd' trees. The distance is
+    computed using the L2 (Euclidean) metric. Please see package 'RANN.L1'
+    for the same functionality using the L1 (Manhattan, taxicab) metric.
+License: GPL (>=3)
 URL: https://github.com/jefferis/RANN
 BugReports: https://github.com/jefferis/RANN/issues
-Encoding: UTF-8
-License: GPL (>=3)
 Suggests:
     testthat
-Version: 2.6.1
+Copyright: ANN library is copyright University of Maryland and
+    Sunil Arya and David Mount. See file COPYRIGHT for details.
+Encoding: UTF-8
 RoxygenNote: 6.1.1