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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call