GitLab

While CountKmerAffectAnalyser is more flexible, the heuristic implemented
in KmerAffectAnalyser is more efficient, that's why we use it in the KmerSegmenter

The function actually checks if there is a segmentation, including the main Vend/Jstart computation.

We update accordingly the tests to see if we're lacking V or J.
In some very specific cases we may have some V and some J, but still not be able to find a maximum.
We put the cause of unsegmentation to UNSEG_TOO_FEW_ZERO which may be misleading but somehow represents the reality (we have zero valuable information)

Positions are now correct from the beginning, since we do not allow an overlap
in CountKmerAffectAnalyser. So we don't need to modify them slightly.

'removeChevauchement' and possibly other infos

	* Refactored main vidjil.cpp (core/windows.cpp, core/windowExtractor.cpp)
	* Removed unused html output
	* Better json output (core/json.cpp)
	* Updated main stdout, with representative sequence for each clone
	* Updated parameters for FineSegmenter (delta_max) and dynprog (substition cost)
	* Bugs closed

	* Better heuristic, segments more reads (core/segment.cpp)
	* Better and faster selection of representative read (vidjil.cpp, core/read_chooser.cpp)
	* Better display of reason of non-segmenting reads
	* New normalization against a standard (-Z) (core/labels.cpp)
	* New experimental lazy_msa multiple aligner
	* New .json output
	* New unit tests
	* Bugs closed

	* New selection of representative read (core/read_chooser.cpp)
	* Faster spaced seed computation (core/tools.cpp)
	* New unit tests
	* Bugs closed

	* First public release