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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_29 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1600024060 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:15, 1 July 2024