Sequence recognition algorithm

Here, the sequence recognization algorithm. The algorithm is working in three steps:

• From the original data as raw list, I create mutants list containing all the subset of the main list

• I consider each mutant as a claiming sequence

• I verifiy and count (if verified) the number of repetition

cmatrix.count_seq	Count the number of sequences repetiotion in the given data segment as list.
cmatrix.create_mutants	Create the 'mutants lists' from the original one.
cmatrix.cut	Cut the liste from the pivot (as double argument).
cmatrix.find_invariant	Find the invariant part since the beggining until the sequence repetitions start.
cmatrix.find_max	Search into the list of list containing all the claiming sequences the longest one.
cmatrix.find_mul_seq	The main sequence finder algorithm.
cmatrix.find_seq	Search a sequence into the parameter list.
cmatrix.find_seq_in_list	Test if the given sequence have been found in the raw data (given as list)
cmatrix.split_data	A data splitter to treat a large amount of data.
cmatrix.split_number	Split a number by heigth in decimal base.