diff --git a/.DS_Store b/.DS_Store
index 418495b..0810f24 100644
Binary files a/.DS_Store and b/.DS_Store differ
diff --git a/Neighbours_finding/.DS_Store b/Neighbours_finding/.DS_Store
index d612009..30f813c 100644
Binary files a/Neighbours_finding/.DS_Store and b/Neighbours_finding/.DS_Store differ
diff --git a/Neighbours_finding/README b/Neighbours_finding/README
index fb4ffa1..50e9d36 100644
--- a/Neighbours_finding/README
+++ b/Neighbours_finding/README
@@ -4,8 +4,8 @@ Neighbours finding can be done using two methods:
 - Polygons build from the membrane staning 
 - Eucledian distance calculated using a user defined distance from each center point (cell)
 
-In order to follow the tutorial the users can download our provided (test) raw data in the Raw_data/ folder. 
-The results of the script are also provided in the folder Neighbours_results/ for comparison. A screen shot of 
-the polygon expansion (before and after 0.6um expansion) is also provided for comparison. 
+In order to use the R scripts users can download our provided raw data in the Raw_data/ folder. 
+The results of the script are also provided in the folder Neighbours_results/ for comparison. 
+A screen shot of the polygon expansion (before and after 0.6um expansion) is also provided for comparison. 
 
 For more details about the different methods see publication