Title of article
Bit-parallel string matching under Hamming distance in O(n m/w ) worst case time
Author/Authors
Szymon Grabowski، نويسنده , , Kimmo Fredriksson، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2007
Pages
6
From page
182
To page
187
Keywords
approximate string matching , hamming distance , Bit-parallelism , Algorithms
Journal title
Information Processing Letters
Serial Year
2007
Journal title
Information Processing Letters
Record number
130555
Link To Document