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

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

datePublished

• 2007

identifier

• propertyID: FI-FENNI value: 860487
• propertyID: FI-MELINDA value: 000477681
• propertyID: skl value: fx860487

isbn

• 9789524589604

isPartOf

• Fennica
• Report series / University of Joensuu, Department of Computer Science. A

name

• Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time

numberOfPages

• 6 s.
• 6, [1] s.

P60048

• <http://rdaregistry.info/termList/RDACarrierType/1049>

P60050

• <http://rdaregistry.info/termList/RDAMediaType/1007>

publication

• location: Joensuu organizer: Joensuun yliopisto

publisher

• Joensuun yliopisto