"Bit-parallel string matching under Hamming distance in O(n[m/w]) worst ..."

Szymon Grabowski, Kimmo Fredriksson (2008)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2007.08.021

access: closed

type: Journal Article

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/GrabowskiF08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/GrabowskiF08
Szymon Grabowski, Kimmo Fredriksson:
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time. Inf. Process. Lett. 105(5): 182-187 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.