Fast exact string matching algorithms

String matching is the problem of finding all the occurrences of a pattern in a text. We propose a very fast new family of string matching algorithms based on hashing q-grams. The new algorithms are the fastest on many cases, in particular, on small size alphabets.

Uložené v:

Podrobná bibliografia
Vydané v:	Information processing letters Ročník 102; číslo 6; s. 229 - 235
Hlavný autor:	Lecroq, Thierry
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 15.06.2007 Elsevier Science Elsevier Sequoia S.A Elsevier
Predmet:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Data processing. List processing. Character string processing Data Structures and Algorithms Design of algorithms Exact sciences and technology Hashing Information processing Memory organisation. Data processing Software String matching Studies Theoretical computing Design of algorithms Hashing String matching Computer theory Information processing Fast algorithm Algorithm analysis
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!

Buďte prvý, kto okomentuje tento záznam!