scientific article; zbMATH DE number 2247683

MaRDI QIDQ5718878zbMATH OpenFDO

Authors Longtao He, Binxing Fang, Xiangzhan Yu

Publication date 16 January 2006

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.9550

zbMATH Keywords

complexity analysisfinite automatonsuffix automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonnumerical algorithms (68W05)

Recommendations

• The wide window string matching algorithm
• Simple Optimal String Matching Algorithm
• Publication:3468609
• A New String Matching Algorithm
• scientific article; zbMATH DE number 1615293

Cited in

(9)

• Faster algorithm for single pattern matching
• Improvement of the search window shift calculation in MAWP search algorithms
• A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
• A constant-time optimal parallel string-matching algorithm
• The wide window string matching algorithm
• New method of curve modeling based on continuity for extension-Bézier curves
• Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm
• Simple Optimal String Matching Algorithm
• Single pattern matching algorithms based on hybrid strategy

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5718878)