A preprocessing for approximate string matching

Kensuke Baba, Tetsuya Nakatoh, Yasuhiro Yamada, Daisuke Ikeda

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

1 Citation (Scopus)

Abstract

Approximate string matching is a basic and important concept in many applications of information retrieval. This paper proposes an algorithm for the problem of approximate string matching. The algorithm solves the match-count problem as a preprocessing. For input strings of each length n, the time complexities of the approximate string matching problem and the match-count problem are O(n2) and O(nlogn), respectively. Therefore, the computation time of the algorithm is expected to be short when the scope of search is drastically restricted by the preprocessing. This paper makes clear the relation between the solutions of the two problems.

Original languageEnglish
Title of host publicationInformatics Engineering and Information Science - International Conference, ICIEIS 2011, Proceedings
Pages610-615
Number of pages6
EditionPART 2
DOIs
Publication statusPublished - 2011
EventInternational Conference on Informatics Engineering and Information Science, ICIEIS 2011 - Kuala Lumpur, Malaysia
Duration: Nov 14 2011Nov 16 2011

Publication series

NameCommunications in Computer and Information Science
NumberPART 2
Volume252 CCIS
ISSN (Print)1865-0929

Conference

ConferenceInternational Conference on Informatics Engineering and Information Science, ICIEIS 2011
CountryMalaysia
CityKuala Lumpur
Period11/14/1111/16/11

Keywords

  • FFT
  • algorithm
  • approximate string matching

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'A preprocessing for approximate string matching'. Together they form a unique fingerprint.

  • Cite this

    Baba, K., Nakatoh, T., Yamada, Y., & Ikeda, D. (2011). A preprocessing for approximate string matching. In Informatics Engineering and Information Science - International Conference, ICIEIS 2011, Proceedings (PART 2 ed., pp. 610-615). (Communications in Computer and Information Science; Vol. 252 CCIS, No. PART 2). https://doi.org/10.1007/978-3-642-25453-6_50