Average complexity of backward q-gram string matching algorithms

Many efficient string matching algorithms make use of q-grams and process the text in windows which are read backward. In this paper we provide a framework for analyzing the average case complexity of these algorithms taking into account the statistical dependencies between overlapping q-grams. We a...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 112; číslo 11; s. 433 - 437
Hlavný autor:	Salmela, Leena
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 15.06.2012 Elsevier Sequoia S.A
Predmet:	Algorithms Analysis of algorithms Average case complexity Complexity Computer science Data processing Mathematical problems Optimization String matching Studies Texts Average case complexity Analysis of algorithms String matching
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!