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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4534878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Bit-Parallel Algorithms for (δ,α)-Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-parallel witnesses and their applications to approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast bit-vector algorithm for approximate string matching based on dynamic programming / rank
 
Normal rank

Latest revision as of 10:15, 1 July 2024