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

DOI10.1007/S11432-011-4363-ZzbMath1267.68328OpenAlexW2009641283MaRDI QIDQ350914

Mohammad Hasan, M. Dambrine

Publication date: 3 July 2013

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4363-z

zbMATH Keywords

complete automatonmultiple string matchingU-uncertain-stringsU-V-uncertain-stringsV-uncertain-strings

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms on strings (68W32)

Cites Work

• A Table Compression Method for Extended Aho-Corasick Automaton
• Efficient string matching
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm