Faster Approximate String Matching for Short Patterns

Research output: Contribution to journal › Journal article › Research › peer-review

Keywords

@article{7a3f313fb3eb4ff5beaba415bf3db42b,

title = "Faster Approximate String Matching for Short Patterns",

keywords = "Algorithms, Approximate string matching, Word-level parallelism",

author = "Philip Bille",

year = "2012",

doi = "10.1007/s00224-011-9322-y",

language = "English",

volume = "50",

pages = "492–515",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - Faster Approximate String Matching for Short Patterns

AU - Bille, Philip

PY - 2012

Y1 - 2012

KW - Algorithms

KW - Approximate string matching

KW - Word-level parallelism

U2 - 10.1007/s00224-011-9322-y

DO - 10.1007/s00224-011-9322-y

M3 - Journal article

SN - 1432-4350

VL - 50

SP - 492

EP - 515

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 3

ER -