Abstract:
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...Show MoreMetadata
Abstract:
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.
Date of Conference: 10-12 August 2009
Date Added to IEEE Xplore: 21 August 2009
ISBN Information: