Update README.md

README.md

@@ -9,11 +9,11 @@ The genericity of copar covers the minimization of
   - and *combinations* thereof (under derived bismilarity notions, e.g. backwards bisimilarity for weighted tree automata).
 
 The algorithm runs in *O(m log n)* on a system with *n* states and *m*
-transitions and has been developed in a series of publications, see the [Literature](doc/literature.md) file.
-
-For installation, see the [Install](INSTALL.md) file.
+transitions and has been developed in a series of publications, see the [literature file](doc/literature.md).
 
 ## Usage
+Installation instructions can be found in the [install file](INSTALL.md).
+
 The core partition-refinement algorithm can be called by
 
     ./copar refine FILENAME