Universal-mer

Universal-mer is the k-mer counting tool for all possible size of k at once. More than typical k-mer counting tool, the program can summarize the exact counting result of 1-mers to l-mers at once where l = the length of longest repeated substring in the input sequence which now is set the maximum length to 100000-mers. The program can report exactly the number of all repeat (freq>1) and unique(freq = 1) mers , and the number of all possible substrings of the sequence without cutting off any low frequency mers.