Pattern matching with wildcards based on key character location

Authors:
Yingling Liu;Xindong Wu;Xuegang Hu;Jun Gao;Gongqing Wu;Haiping Wang;Xiaoli Hong
Affiliations:
School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China and School of Physics, University of Science and Technology of China, Hefei, China;Department of Computer Science, University of Vermont, Burlington, VT and School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China;School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China;School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China;School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China;School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China;School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China
Venue:
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
Year:
2009

Citing 7
Cited 1

An algorithm for string matching with a sequence of don't cares

Information Processing Letters
Non-standard stringology: algorithms and complexity

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Efficient pattern-matching with don't cares

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Faster Algorithms for String Matching Problems: Matching the Convolution Bound

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Dictionary matching and indexing with errors and don't cares

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Scalable sequential pattern mining for biological sequences

Proceedings of the thirteenth ACM international conference on Information and knowledge management

Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.