Affordable Access

Publisher Website

Approximate string matching with don't care characters

Authors
Journal
Information Processing Letters
0020-0190
Publisher
Elsevier
Publication Date
Volume
55
Issue
5
Identifiers
DOI: 10.1016/0020-0190(95)00111-o
Keywords
  • Approximate String Matching
  • Don'T Care Characters
  • Design Of Algorithms
Disciplines
  • Computer Science

Abstract

Abstract This paper presents an O(√ kmnpolylog( m)) time algorithm for approximate string matching ( k-differences problem), in which don't care characters may appear both in a pattern string and in a text string.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments