A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2011.03.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2037649997
@@ Property / OpenAlex ID: W2037649997 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast string searching algorithm
@@ Property / cites work: A fast string searching algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4849531
@@ Property / cites work: Q4849531 / rank @@
+Normal rank
@@ Property / cites work @@
+Shift-or string matching with super-alphabets
@@ Property / cites work: Shift-or string matching with super-alphabets / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient randomized pattern-matching algorithms
@@ Property / cites work: Efficient randomized pattern-matching algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Pattern Matching in Strings
@@ Property / cites work: Fast Pattern Matching in Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Fast and flexible string matching by combining bit-parallelism and suffix automata
+Normal rank
@@ Property / cites work @@
+String Processing and Information Retrieval
@@ Property / cites work: String Processing and Information Retrieval / rank @@
+Normal rank
@@ Property / cites work @@
+Multipattern string matching with             <i>q</i>             -grams
@@ Property / cites work: Multipattern string matching with <i>q</i> -grams / rank @@
+Normal rank