Average complexity of exact and approximate multiple string matching
From MaRDI portal
Publication:1885904
DOI10.1016/j.tcs.2004.03.058zbMath1070.68046MaRDI QIDQ1885904
Gonzalo Navarro, Kimmo Fredriksson
Publication date: 12 November 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/175115
68W05: Nonnumerical algorithms
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns, Average complexity of backward \(q\)-gram string matching algorithms, Sequential and indexed two-dimensional combinatorial template matching allowing rotations, FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME
Cites Work
- Unnamed Item
- Speeding up two string-matching algorithms
- Fast practical multi-pattern matching
- An Improved Algorithm For Approximate String Matching
- Average-Optimal Multiple Approximate String Matching
- The Complexity of Pattern Matching for a Random String
- Efficient string matching
- Fast Pattern Matching in Strings
- Combinatorial Pattern Matching