Fast bit-vector algorithms for approximate string matching under indel distance

Heikki Hyyrö, Yoan Pinzon, Ayumi Shinohara

研究成果: Conference article査読

6 被引用数 (Scopus)


The approximate string matching problem is to find all locations at which a query p of length m matches a substring of a text t of length n with at most k differences (insertions, deletions, substitutions). The fastest solutions in practice for this problem are the bit-parallel NFA simulation algorithms of Wu & Manber [4] and Baeza-Yates & Navarro [1], and the bit-parallel dynamic programming algorithm of Myers [3]. In this paper we present modified versions of these algorithms to deal with the restricted case where only insertions and deletions (called indel for short) are permitted. We also show test results with the algorithms.

ジャーナルLecture Notes in Computer Science
出版ステータスPublished - 2005 9 9
イベント31st Conference on Current Trends in Theory and Practice of Computer Science - Liptovsky Jan, Slovakia
継続期間: 2005 1 222005 1 28

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Fast bit-vector algorithms for approximate string matching under indel distance」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。