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...

Celý popis

Podrobná bibliografia

Vydané v:	Cybernetics and systems Ročník 42; číslo 6; s. 382 - 401
Hlavní autori:	Guo, Dan, Hong, Xiao-Li, Hu, Xue-Gang, Gao, Jun, Liu, Ying-Ling, Wu, Gong-Qing, Wu, Xindong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Taylor & Francis Group 01.08.2011
Predmet:	bit-parallelism length contraints nondeterministic automatons one-off condition pattern matching wildcards
ISSN:	0196-9722, 1087-6553
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!