Nested Counters in Bit-Parallel String Matching (Q3618593): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-00982-2_29
+Normal rank
@@ Property / OpenAlex ID @@
+W1600024060
@@ Property / OpenAlex ID: W1600024060 / rank @@
+Normal rank
@@ Property / cites work @@
+Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
+Normal rank
@@ Property / cites work @@
+Surpassing the information theoretic bound with fusion trees
+Normal rank
@@ Property / cites work @@
+Q4534878
@@ Property / cites work: Q4534878 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Bit-Parallel Algorithms for (δ,α)-Matching
+Normal rank
@@ Property / cites work @@
+Q4432971
@@ Property / cites work: Q4432971 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient string matching with k mismatches
@@ Property / cites work: Efficient string matching with k mismatches / rank @@
+Normal rank
@@ Property / cites work @@
+Bit-parallel witnesses and their applications to approximate string matching
+Normal rank
@@ Property / cites work @@
+A fast bit-vector algorithm for approximate string matching based on dynamic programming
+Normal rank