Fast and flexible packed string matching

Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biology. In the last two decades a general trend has appeared trying to exploit the powe...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of discrete algorithms (Amsterdam, Netherlands) Ročník 28; s. 61 - 72
Hlavní autori:	Faro, Simone, Külekci, M. Oğuzhan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.09.2014
Predmet:	Exact string matching Experimental algorithms Information retrieval Online searching Text algorithms Online searching Information retrieval Text algorithms Experimental algorithms Exact string matching
ISSN:	1570-8667, 1570-8675
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!