Average complexity of backward q-gram string matching algorithms

Forskningsoutput: Tidskriftsbidrag › Artikel › Vetenskaplig › Peer review

Originalspråk	engelska
Tidskrift	Information Processing Letters
Volym	112
Nummer	11
Sidor (från-till)	433-437
Antal sidor	5
ISSN	0020-0190
DOI	https://doi.org/10.1016/j.ipl.2012.02.010
Status	Publicerad - 2012
MoE-publikationstyp	A1 Tidskriftsartikel-refererad

Vetenskapsgrenar

@article{bd136cc1bd53438c8e5f510ebed29253,

title = "Average complexity of backward q-gram string matching algorithms",

keywords = "Analysis of algorithms, String matching, Average case complexity, 113 Computer and information sciences",

author = "Leena Salmela",

year = "2012",

doi = "10.1016/j.ipl.2012.02.010",

language = "English",

volume = "112",

pages = "433--437",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "11",

}

TY - JOUR

T1 - Average complexity of backward q-gram string matching algorithms

AU - Salmela, Leena

PY - 2012

Y1 - 2012

KW - Analysis of algorithms

KW - String matching

KW - Average case complexity

KW - 113 Computer and information sciences

U2 - 10.1016/j.ipl.2012.02.010

DO - 10.1016/j.ipl.2012.02.010

M3 - Article

SN - 0020-0190

VL - 112

SP - 433

EP - 437

JO - Information Processing Letters

JF - Information Processing Letters

IS - 11

ER -