DNA motifs detection algorithms in long sequences

The identification of DNA motifs remains an active challenge for the researchers in the bioinformatics domain. A considerable effort in this area was concentrated on understanding the evolution of the genome by identifying the DNA binding sites for transcription factors. The evolution in genome sequencing has led to the appearance of numerous computational methods for finding the short DNA segments, known as motifs. In this study, we present some of the computational methods that exist and try to evaluate their performance in case of long sequences.