Scientific Research and Essays

  • Abbreviation: Sci. Res. Essays
  • Language: English
  • ISSN: 1992-2248
  • DOI: 10.5897/SRE
  • Start Year: 2006
  • Published Articles: 2768

Full Length Research Paper

Discovered motifs with using parallel Mprefixspan method

Hamid Alinejad Rokny1, Mir Mohsen Pedram2 and Hossein Shirgahi3*
1Computer Engineering Department, Science and Research Branch, Islamic Azad University, Tehran, Iran. 2Computer Engineering Department, Faculty of Engineering, Tarbiat Moallem University, Tehran, Iran. 3Young Researchers Club,Jouybar Branch, Islamic Azad University, Jouybar, Iran.
Email: [email protected]

  •  Accepted: 24 May 2011
  •  Published: 19 September 2011


The parallelization of a prefixspan method to discover motifs is proposed in this paper. The prefixspan method is used to extract the frequent pattern from a sequence database. This system requires the use of multiple computers connected in local area network. This algorithm includes multi-threads to achieve communication between a master process and multiple slave processes. This algorithm applies dynamic scheduling to avoid tasks idling. Moreover we employ a technique, called selective sampling. We implement this algorithm with using a 4G memory and AMD phenom X4. Our experimental results show that this algorithm attains good efficiencies on motifs extraction.


Key words: Motif discovery, parallel mining, wild cards, task scheduling, sequence mining, thread scheduling, parallel tree, DNA sequences.