Fast exact string matching algorithms
From MaRDI portal
Publication:846013
DOI10.1016/J.IPL.2007.01.002zbMATH Open1184.68605OpenAlexW2048187990MaRDI QIDQ846013FDOQ846013
Authors: Thierry Lecroq 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.01.002
Recommendations
Cites Work
- Title not available (Why is that?)
- Efficient randomized pattern-matching algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (29)
- A fast suffix automata based algorithm for exact online string matching
- Fast and flexible packed string matching
- Linear and efficient string matching algorithms based on weak factor recognition
- Fast string matching for multiple searches
- A New String Matching Algorithm
- Parallel String Matching
- Fast string matching with k differences
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
- Improvement of the search window shift calculation in MAWP search algorithms
- An aggressive algorithm for multiple string matching
- Boosting pattern matching performance via \(k\)-bit filtering
- Average complexity of backward \(q\)-gram string matching algorithms
- On String Matching in Chunked Texts
- Efficient variants of the backward-oracle-matching algorithm
- The Range Automaton: an efficient approach to text-searching
- Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
- Improving practical exact string matching
- Fast string matching for DNA sequences
- Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences
- A weak approach to suffix automata simulation for exact and approximate string matching
- A very fast string matching algorithm based on condensed alphabets
- A family of fast constant-space substring search algorithms
- String Processing and Information Retrieval
- Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
- Tuning string matching for huge pattern sets
- FFT-based algorithms for the string matching with mismatches problem
- String matching with lookahead
- Multipattern string matching with q -grams
- Faster string matching based on hashing and bit-parallelism
This page was built for publication: Fast exact string matching algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846013)
