The improvement and implementation in the algorithm of finding maximal motifs in DNA sequences

DNA sequences are formed by nucleotides A;C; G; T. Often, a particular word called motif can occur in many sequences of a group. There has been an algorithm to find both the frequent and the maximal motif in the DNA sequences, but it has some disadvantages. Such as the time and place cost is very high. In the paper, we build a tree based on the motif length to improve it, and implement a small system according to the original and improved algorithm. Then we compare the latest new algorithms about the problem with them, and give the empirical result of them.