See Algorithm::Diff, especially the LSC_length function in http://search.cpan.org/~tyemq/Algorithm-Diff-1.1903/lib/Algorithm/Diff.pm#LCS_length.

The program looks for your name's letters as subsequences of the words in the word list. If the length of the found subsequence is equal to the length of your name, then it means that all letters of your name were found in the right order in the candidate word.