Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm

Nebel M (2006)
Theor. Comput. Sci. 359(1-3): 329--343.

Zeitschriftenaufsatz | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Erscheinungsjahr
2006
Zeitschriftentitel
Theor. Comput. Sci.
Band
359
Ausgabe
1-3
Seite(n)
329--343
ISSN
0304-3975
Page URI
https://pub.uni-bielefeld.de/record/2910034

Zitieren

Nebel M. Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm. Theor. Comput. Sci. 2006;359(1-3):329--343.
Nebel, M. (2006). Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm. Theor. Comput. Sci., 359(1-3), 329--343. doi:10.1016/j.tcs.2006.05.028
Nebel, M. (2006). Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm. Theor. Comput. Sci. 359, 329--343.
Nebel, M., 2006. Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm. Theor. Comput. Sci., 359(1-3), p 329--343.
M. Nebel, “Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm”, Theor. Comput. Sci., vol. 359, 2006, pp. 329--343.
Nebel, M.: Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm. Theor. Comput. Sci. 359, 329--343 (2006).
Nebel, Markus. “Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm”. Theor. Comput. Sci. 359.1-3 (2006): 329--343.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®

Suchen in

Google Scholar