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ženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 102; číslo 6; s. 229 - 235
Hlavní autor: Lecroq, Thierry
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 15.06.2007
Elsevier Science
Elsevier Sequoia S.A
Elsevier
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2007.01.002