Pattern matching with wildcards based on key character location

Pattern matching with wildcards is a complex problem and this problem has wide potential application in text search, biological sequences and information security etc. We propose a new algorithm called Quicksearch, for pattern matching with wildcards and length constraints based on key character location and subspace partition. This new algorithm increases by 40%-60% searching efficiency in comparison with SAIL when characters of pattern P in text T are unevenly distributed.