Riesen, KasparSchmidt, Roman2024-03-202024-03-2020191433-28251433-283310.1007/s10032-019-00316-1https://irf.fhnw.ch/handle/11654/42431Handwritten signatures are widely used and well-accepted biometrics for personal authentication. The accuracy of signature verification systems has significantly improved in the last decade, making it possible to rely on machines in particular cases or to support human experts. Yet, based on only few genuine references, signature verification is still a challenging task. The present paper provides a comprehensive comparison of two prominent string matching algorithms that can be readily used for signature verification. Moreover, it evaluates a recent cost model for string matching which turns out to be particularly well suited for the task of signature verification. On three benchmarking data sets, we show that this model outperforms the two standard models for string matching with statistical significance.en330 - Wirtschaft01A - Beitrag in wissenschaftlicher Zeitschrift41-54