A novel parallel motif discovery algorithm based on de Bruijn graph

This paper attempts to provide a new approach to discover conserved regions such as motifs in either DNA or Protein sequences. We not only use the idea of de Bruijn graphs, but also follow a parallel approach to solve this problem. The de Bruijn graph has been successfully adopted to solve problems such as local alignment and DNA fragment assembly. To accelerate the speed, our method harnesses the power of parallelism to discover the conserved regions in a DNA or protein sequence. We have found that the algorithm was successful in mining signals for larger number of sequences and at a faster rate when compared to some popular motif searching tools.