Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm

Multiple string matching is often completed under the presence of U- or V-uncertain-strings,or combinations thereof.Recognizing large numbers of strings with U-, V-,and U-V-uncertain-strings,including the interleaving of two or more uncertain strings,is important to thoroughly gathering useful infor...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Science China. Information sciences 2011-08, Vol.54 (8), p.1562-1571
Hauptverfasser:	Hu, Yue, Gao, QingShi, Guo, Li, Wang, PeiFeng
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Automation Computer Science Construction High speed Information Systems and Communication Service Research Papers String matching Strings 信息检测 字符串匹配 巨人 正则表达式 算法 自动机
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!