String matching with mismatches by real-valued FFT

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string matching with mismatches, which computes an estimate with accuracy. The algorithm consists of FFT computations for binary vectors which can be computed faster than the computation for vectors of complex numbers. Therefore, a reduction of the computation time is obtained by the speed-up for FFT, which leads an improvement of the variance of the estimates. This paper analyzes the variance of the estimates in the algorithm and compares it with the variances in existing algorithms.

Original languageEnglish
Title of host publicationComputational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings
PublisherSpringer Verlag
Pages273-283
Number of pages11
EditionPART 4
ISBN (Print)3642121888, 9783642121883
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event2010 International Conference on Computational Science and Its Applications, ICCSA 2010 - Fukuoka, Japan
Duration: Mar 23 2010Mar 26 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 4
Volume6019 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2010 International Conference on Computational Science and Its Applications, ICCSA 2010
Country/TerritoryJapan
CityFukuoka
Period3/23/103/26/10

Keywords

  • FFT
  • Randomized algorithm
  • String matching with mismatches

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'String matching with mismatches by real-valued FFT'. Together they form a unique fingerprint.

Cite this