SIAM Journal on Computing
Software—Practice & Experience
A technique for two-dimensional pattern matching
Communications of the ACM - Special issue: multiprocessing
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
Text algorithms
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Fast and flexible string matching by combining bit-parallelism and suffix automata
Journal of Experimental Algorithmics (JEA)
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
A String Matching Algorithm Fast on the Average
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Faster String Matching with Super-Alphabets
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Approximate Multiple Strings Search
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Fast Content-Based Packet Handling for Intrusion Detection
Fast Content-Based Packet Handling for Intrusion Detection
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Practical and optimal string matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
A partition-based efficient algorithm for large scale multiple-strings matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Fast parameterized matching with q-grams
Journal of Discrete Algorithms
XML-document-filtering automaton
Proceedings of the VLDB Endowment
Succinct backward-DAWG-matching
Journal of Experimental Algorithmics (JEA)
Extremely fast text feature extraction for classification and indexing
Proceedings of the 17th ACM conference on Information and knowledge management
Multi-patterns parameterized shift-and string matching algorithm with super alphabets
Proceedings of the International Conference on Advances in Computing, Communication and Control
GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences
International Journal of Bioinformatics Research and Applications
SCAMPI: a scalable CAM-based algorithm for multiple pattern inspection
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
A fast bit-parallel multi-patterns string matching algorithm for biological sequences
ISB '10 Proceedings of the International Symposium on Biocomputing
Efficient bit-parallel multi-patterns string matching algorithms for limited expression
Proceedings of the Third Annual ACM Bangalore Conference
Algorithms for weighted matching
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Small subset queries and bloom filters using ternary associative memories, with applications
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
MPSCAN: fast localisation of multiple reads in genomes
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
SigMatch: fast and scalable multi-pattern matching
Proceedings of the VLDB Endowment
Bouma2: a high-performance input-aware multiple string-match algorithm
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Information and Computation
Approximate string matching with reduced alphabet
Algorithms and Applications
Average complexity of backward q-gram string matching algorithms
Information Processing Letters
Fast multiple string matching using streaming SIMD extensions technology
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
Journal of Experimental Algorithmics (JEA)
An efficient multicharacter transition string-matching engine based on the aho-corasick algorithm
ACM Transactions on Architecture and Code Optimization (TACO)
| Hi-index | 0.00 |
We present three algorithms for exact string matching of multiple patterns. Our algorithms are filtering methods, which apply q-grams and bit parallelism. We ran extensive experiments with them and compared them with various versions of earlier algorithms, e.g., different trie implementations of the Aho--Corasick algorithm. All of our algorithms appeared to be substantially faster than earlier solutions for sets of 1,000--10,000 patterns and the good performance of two of them continues to 100,000 patterns. The gain is because of the improved filtering efficiency caused by q-grams.