X-Git-Url: https://git.auder.net/?a=blobdiff_plain;f=README.md;h=2b103b27898cc4dea3821d094b4e00f6ee4adcfb;hb=311c5c078a9fc8ec6bb449fa685dbb1657d75d39;hp=d510f696add3cc0f6439144b8a57b6fc21b3bd12;hpb=fbae2f8c4efd1ef3494069ea52c136c4de126536;p=epclust.git

diff --git a/README.md b/README.md
index d510f69..2b103b2 100644
--- a/README.md
+++ b/README.md
@@ -7,7 +7,7 @@ Joint work with [Jairo Cugliari](http://eric.univ-lyon2.fr/~jcugliari/),
 ---
 
 This program takes n time-series in input and is divided in two stages:
-  1) (Heuristic) k-medoids algorithm in parallel to obtain K centers, K << n
+	1) (Heuristic) k-medoids algorithm in parallel to obtain K centers, K << n
 	2) Filtering WER(?) to obtain the final k < K group representations.
 
 ---