Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
STRING-MATCHING AND OTHER PRODUCTS
STRING-MATCHING AND OTHER PRODUCTS
Dictionary matching and indexing with errors and don't cares
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Information Extraction from the Web: System and Techniques
Applied Intelligence
Bases of Motifs for Generating Repeated Patterns with Wild Cards
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Mining periodic patterns with gap requirement from sequences
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
BIBM '07 Proceedings of the 2007 IEEE International Conference on Bioinformatics and Biomedicine
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Pattern matching with wildcards based on key character location
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
Pattern Matching with Independent Wildcard Gaps
DASC '09 Proceedings of the 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing
A hash trie filter method for approximate string matching in genomic databases
Applied Intelligence
Pattern Matching with Flexible Wildcards and Recurring Characters
GRC '10 Proceedings of the 2010 IEEE International Conference on Granular Computing
String matching with variable length gaps
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Approximate data instance matching: a survey
Knowledge and Information Systems
HUC-Prune: an efficient candidate pruning technique to mine high utility patterns
Applied Intelligence
Automatic extraction of acronym definitions from the Web
Applied Intelligence
RP-Miner: a relaxed prune algorithm for frequent similar pattern mining
Knowledge and Information Systems
A BIT-PARALLEL ALGORITHM FOR SEQUENTIAL PATTERN MATCHING WITH WILDCARDS
Cybernetics and Systems
Applied Intelligence
Classifier-based acronym extraction for business documents
Knowledge and Information Systems
Aggregate keyword search on large relational databases
Knowledge and Information Systems
Mining interesting user behavior patterns in mobile commerce environments
Applied Intelligence
MAIL: mining sequential patterns with wildcards
International Journal of Data Mining and Bioinformatics
Hi-index | 0.00 |
Pattern matching with wildcards is a challenging topic in many domains, such as bioinformatics and information retrieval. This paper focuses on the problem with gap-length constraints and the one-off condition (The one-off condition means that each character can be used at most once in all occurrences of a pattern in the sequence). It is difficult to achieve the optimal solution. We propose a graph structure WON-Net (WON-Net is a graph structure. It stands for a network with the weighted centralization measure based on each node's centrality-degree. Its details are given in Definition 4.1) to obtain all candidate matching solutions and then design the WOW (WOW stands for pattern matching with wildcards based on WON-Net) algorithm with the weighted centralization measure based on nodes' centrality-degrees. We also propose an adjustment mechanism to balance the optimal solutions and the running time. We also define a new variant of WOW as WOW-驴. Theoretical analysis and experiments demonstrate that WOW and WOW-驴 are more effective than their peers. Besides, the algorithms demonstrate an advantage on running time by parallel processing.