Bit-parallel computation for wavefront algorithm

E. Hanmei, Kensuke Baba, Yunqing Yu, Kazuaki Murakami

Research output: Contribution to journalArticlepeer-review


This paper presents a parallel algorithm for solving the edit distance problem. The edit distance represents a similarity of two strings and the dynamic programming approach is a general paradigm to compute an edit distancie. There exists an efficient method of parallel computation which is based on bit-operations, however the computation in this method is very complex. In this paper, a simple parallel-algorithm for a single processor is proposed. Moreover, our algorithm can be applied to the alignment problem.

Original languageEnglish
Pages (from-to)1-6
Number of pages6
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Issue number1
Publication statusPublished - Mar 2007
Externally publishedYes


  • Bit-operation
  • Dynamic programming approach
  • Edit distance
  • Parallel computation
  • Time complexity

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering


Dive into the research topics of 'Bit-parallel computation for wavefront algorithm'. Together they form a unique fingerprint.

Cite this