We propose an algorithm to solve the multiple patterns approximate string matching problem. Our algorithm uses a hashing table to quickly find all possible positions. Our algorithm is very efficient for multiple patterns with different lengths. We also implemented our algorithm to solve the short oligonucleotide alignment on a long reference DNA sequence problem. The experimental results show that our algorithm is faster than one of the fastest algorithm available now, SOAP.