2013-08-02 David Parsons <david.parsons@inria.fr>
	* 1.8.2 -> 1.8.3
	New build organization: main binary kissplice remains in the bin directory, all the secondary binaries now go to lib/kissplice

2013-06-03 Vincent Miele <vincent.miele@univ-lyon1.fr>
	* 1.8.1 -> 1.8.2
	New kissreads version, more stable
	compressed reads are now valid input
	
2013-04-04 Alice Julien-Laferriere <alice.julien-laferriere@inria.fr>
	* 1.8.0 -> 1.8.1
	Patch: it is now possible to compile and use k-mer > 31
	(use cmake . -DKMERS_OVER_32=ON)
	-C option: default to  0.02
	
2013-03-28  Alice Julien-Laferriere <alice.julien-laferriere@inria.fr>
	* 1.7.1 -> 1.8.0
	De Bruijn Graph construction use new Minia version (v4) much more memory efficient
	Dynamic error removal: a pre-processing step to remove edges with low relative coverage, which are likely sequencing errors.
	Uniform criteria to stop the enumeration: if a bcc reached the timeout OR the maximum number of cycles, nothing is output. This should change the results.

2012-09-01 Gustavo Sacomoto <sacomoto@gmail.com>
	* 1.6.3 -> 1.7
	Python script kissplice replaces shell script kissplice.sh

2012-04-04 Gustavo Sacomoto <sacomoto@gmail.com>
	* 1.6.2 -> 1.6.3
	Bug related to mac OS fixed

2012-03-29 Gustavo Sacomoto <sacomoto@gmail.com>
	* 1.6 -> 1.6.2
    Large k (k>32) bug fixed
    Proper installation using cmake / done by Vincent Miele
	
2012-02-14 Pierre Peterlongo <pierre.peterlongo@inria.fr>
	* 1.5.1 -> 1.6
  	Possibility to chose the output directory (-o)
    Possibility to run kissplice from any directory
    Possibility to avoid the computation of SNPs and sequencing errors (-s)
    Updated manual
    
2012-02-03 Gustavo Sacomoto <sacomoto@gmail.com>
	* 1.5 -> 1.5.1
	Small bug fixed
	
2012-01-23 Pierre Peterongo <pierre.peterlongo@inria.fr>
	* 1.4 -> 1.5
    ranking and sorting results on read coverage and not k-mer coverage
    provides 5 files:
    	uncoherent (a bit useless)
        Type 0: SNPS / sequencing errors
        Type 1: splicing events
        Type 2: Tandem repeats
        Type 3: Short indels
        
2012-01-17 Pierre Peterlongo <pierre.peterlongo@inria.fr>
 	* 1.2 -> 1.4
 	Possibility to use k larger than 32 nt (slower) or smaller than 32 (faster)

2012-01-16 Pierre Peterlongo <pierre.peterlongo@inria.fr>
	* 1.1 -> 1.2
  	Better de-bruijn graph creation
    Read length unlimited
    Checks the read coherency and provides read coverage on results
    
2011-10-28 Gustavo Sacomoto <sacomoto@gmail.com>
	* 1.0 -> 1.1
	Fixed small bugs
	Improved the user guide
    
2011-10-24 Pierre Peterlongo <pierre.peterlongo@inria.fr>
 	* 1.0
 	Initial release

