A BIT-PARALLEL ALGORITHM FOR SEQUENTIAL PATTERN MATCHING WITH WILDCARDS

Pattern matching with both gap constraints and the one-off condition is a challenging topic, especially in bioinformatics, information retrieval, and dictionary query. Among the algorithms to solve the problem, the most efficient one is SAIL, which is time consuming, especially when the pattern is l...

Full description

Bibliographic Details

Published in:	Cybernetics and systems Vol. 42; no. 6; pp. 382 - 401
Main Authors:	Guo, Dan, Hong, Xiao-Li, Hu, Xue-Gang, Gao, Jun, Liu, Ying-Ling, Wu, Gong-Qing, Wu, Xindong
Format:	Journal Article
Language:	English
Published:	Taylor & Francis Group 01.08.2011
Subjects:	bit-parallelism length contraints nondeterministic automatons one-off condition pattern matching wildcards
ISSN:	0196-9722, 1087-6553
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!