Paper Info
Title
Pattern Matching with Flexible Wildcards and Recurring Characters
Abstract
Pattern matching is an important task, which is widely used in many fields, such as information retrieval and bioinformatics. Recently, a much more flexible pattern matching problem with wildcards has been proposed. Chen et al. introduced local constraints, global constraints and the one-off condition into the task of pattern matching, and the most representative algorithm SAIL was designed. However, the performance of SAIL is not analyzed well, which affects its application. Therefore, this paper analyzes the performance of SAIL in-depth, and discovers that the matching result is closely related to the features of patterns. Meanwhile, the completeness of SAIL in the pattern matching with no-recurring characters is proved, and an improved algorithm, named RSAIL, is proposed for pattern matching with recurring tail characters. Extensive experiments demonstrate that RSAIL improves the number of matches by 2.2% compared to SAIL.
Year
DOI
Venue
2010
10.1109/GrC.2010.156
GrC
Keywords
Field
DocType
wildcard,local constraint,completeness,representative algorithm,tail characters,flexible wildcards,rsail,information retrieval,global constraint,pattern matching,extensive experiment,important task,recurring characters,matching,flexible pattern,matching result,bioinformatics,improved algorithm,sail,approximation algorithms,algorithm design and analysis,classification algorithms
Approximation algorithm,Wildcard,Chen,Algorithm design,Pattern recognition,Wildcard character,Computer science,Artificial intelligence,Statistical classification,Completeness (statistics),Pattern matching,Machine learning
Conference
ISBN
Citations 
PageRank 
978-1-4244-7964-1
4
0.40
References 
Authors
12
5
Name
Order
Citations
PageRank
Haiping Wang183.54
Fei Xie21019.98
Xuegang Hu344244.50
Peipei Li41199.58
Xindong Wu58830503.63