A parallel computing algorithm for 16S rRNA probe design

Dianhui Zhu, Yuriy Fofanov, Richard C. Willson, George E. Fox

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

With the continuing rapid increase in the number of available 16S ribosomal RNA (rRNA) sequences, it is a significant computational challenge to efficiently design 16S rRNA targeted probes. In our previous work, we designed a fast software tool called ProkProbePicker (PPP) that takes O (log N) time for a worst-case scenario search. Despite this improvement, it can still take many hours for PPP to extract probes for all the clusters in a phylogenetic tree. Herein, a parallelized version of PPP is described. When run on 80 processors, this version of PPP took only 67 min to extract probes, while some 87 h were needed by the sequential version of PPP. The speedup increased linearly with the increase of CPU numbers, which revealed the outstanding scalability of the parallelized version of PPP.

Original languageEnglish (US)
Pages (from-to)1546-1551
Number of pages6
JournalJournal of Parallel and Distributed Computing
Volume66
Issue number12
DOIs
StatePublished - Dec 1 2006

Keywords

  • 16S rRNA targeted probes
  • Genetic affinity
  • Parallel algorithm

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'A parallel computing algorithm for 16S rRNA probe design'. Together they form a unique fingerprint.

  • Cite this