An improved algorithm for approximate string matching | Zendy

Zvi Galil | Zendy; Kunsoo Park | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An improved algorithm for approximate string matching

Author(s) -

Zvi Galil,

Kunsoo Park

Publication year - 1989

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/bfb0035772

Subject(s) - string searching algorithm , commentz walter algorithm , string (physics) , approximate string matching , computer science , string metric , boyer–moore string search algorithm , algorithm , integer (computer science) , pattern matching , theoretical computer science , artificial intelligence , physics , theoretical physics , programming language

Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research