Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Originalspråkengelska
Titel på gästpublikationProceedings of the Prague Stringology Conference 2013
RedaktörerJan Holub, Jan Žďárek
Antal sidor8
FörlagCzech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology
Utgivningsdatum2013
Sidor168-175
ISBN (tryckt)978-80-01-05330-0
StatusPublicerad - 2013
MoE-publikationstypA4 Artikel i en konferenspublikation
EvenemangPrague Stringology Conference - Prague, Tjeckien
Varaktighet: 2 sep 20134 sep 2013

Vetenskapsgrenar

  • 113 Data- och informationsvetenskap

Citera det här

Kärkkäinen, J., Kempa, D., & Puglisi, S. (2013). Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications. I J. Holub, & J. Žďárek (Red.), Proceedings of the Prague Stringology Conference 2013 (s. 168-175). Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology.
Kärkkäinen, Juha ; Kempa, Dominik ; Puglisi, Simon. / Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications. Proceedings of the Prague Stringology Conference 2013. redaktör / Jan Holub ; Jan Žďárek. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, 2013. s. 168-175
@inproceedings{4983bcf4e4fd4fa9bab3f2fc6c02bf25,
title = "Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications",
keywords = "113 Computer and information sciences",
author = "Juha K{\"a}rkk{\"a}inen and Dominik Kempa and Simon Puglisi",
note = "Volume: Proceeding volume:",
year = "2013",
language = "English",
isbn = "978-80-01-05330-0",
pages = "168--175",
editor = "Jan Holub and Jan Žď{\'a}rek",
booktitle = "Proceedings of the Prague Stringology Conference 2013",
publisher = "Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology",
address = "Czech Republic",

}

Kärkkäinen, J, Kempa, D & Puglisi, S 2013, Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications. i J Holub & J Žďárek (red), Proceedings of the Prague Stringology Conference 2013. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, s. 168-175, Prague Stringology Conference, Prague, Tjeckien, 02/09/2013.

Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications. / Kärkkäinen, Juha; Kempa, Dominik; Puglisi, Simon.

Proceedings of the Prague Stringology Conference 2013. red. / Jan Holub; Jan Žďárek. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, 2013. s. 168-175.

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

TY - GEN

T1 - Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications

AU - Kärkkäinen, Juha

AU - Kempa, Dominik

AU - Puglisi, Simon

N1 - Volume: Proceeding volume:

PY - 2013

Y1 - 2013

KW - 113 Computer and information sciences

M3 - Conference contribution

SN - 978-80-01-05330-0

SP - 168

EP - 175

BT - Proceedings of the Prague Stringology Conference 2013

A2 - Holub, Jan

A2 - Žďárek, Jan

PB - Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology

ER -

Kärkkäinen J, Kempa D, Puglisi S. Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications. I Holub J, Žďárek J, redaktörer, Proceedings of the Prague Stringology Conference 2013. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology. 2013. s. 168-175