v1.0.0

This is the first version of Universal-mer. The features are:

-Summarize distinct repeated and unique 1-mers to l-mers where l = longest length of repeats
-Find the longest repeated substrings of the input sequence.
-Count histogram of k-mers where 1<=k<= the length of an input sequence.
-Count histogram of canonical k-mers where 1<=k<= the length of an input sequence.
-Dump k-mers where 1<=k<= the length of an input sequence.
-Dump canonical k-mers where 1<=k<= the length of an input sequence.
-Query k-mers any size of k where k<=200000 in the input sequences.