By Topic

Parametric string edit distance and its application to pattern recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bunke, H. ; Inst. fur Inf. und Angewandte Math., Bern Univ., Switzerland ; Csirik, J.

A generalized version of the string matching algorithm by Wagner and Fischer (1974) is proposed. It is based on a parametrization of the edit cost. We assume constant cost for any delete and insert operation, but the cost for replacing a symbol is given as a parameter τ. For any two strings A and B, our algorithm computes their edit distance in terms of the parameter τ. We give the new algorithm, study some of its properties, and discuss potential applications to pattern recognition

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:25 ,  Issue: 1 )