Accelerating Search Tree Based Brute Force Motif Discovery Technique on a Processor Cluster


24th Signal Processing and Communication Application Conference (SIU), Zonguldak, Turkey, 16 - 19 May 2016, pp.793-796 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume:
  • Doi Number: 10.1109/siu.2016.7495859
  • City: Zonguldak
  • Country: Turkey
  • Page Numbers: pp.793-796
  • Keywords: bioinformatics, motif finding, brute force techniques, GENE PREDICTION, IDENTIFICATION, ALGORITHM
  • Erciyes University Affiliated: Yes


Determination of conserved regions that plays vital roles on regulation of transcription and translation processes is one of the most challenging problems in bioinformatics. However, with the increasing power of distributed computing systems, solving these types of combinatorial problems by utilizing parallelized brute force or exhaustive search algorithms recently has gained popularity. In this paper, we investigated the parallelized implementation of a search tree based brute force technique to find motifs with different lengths. Experimental studies showed that parallelization of the brute force techniques with less communication overhead is significantly increased the usability of them to analyze long nucleotide sequences.