Dynamic signature verification through the Longest Common Subsequence Problem and Genetic Algorithms

摘要

The following paper includes an automated system that shows the use of signature data for biometric verification. The verification uses the dynamic distinctiveness of the signature, thus this method lies within those referred as dynamic or on-line signature verification. This proposal makes use of a variation of the Longest Common Subsequence Problem together with Genetic Algorithm for this purpose.