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

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2013
EditorsJan Holub, Jan Žďárek
Number of pages8
PublisherCzech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology
Publication date2013
Pages168-175
ISBN (Print)978-80-01-05330-0
Publication statusPublished - 2013
MoE publication typeA4 Article in conference proceedings
EventPrague Stringology Conference - Prague, Czech Republic
Duration: 2 Sep 20134 Sep 2013

Fields of Science

  • 113 Computer and information sciences

Cite this

Kärkkäinen, J., Kempa, D., & Puglisi, S. (2013). Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications. In J. Holub, & J. Žďárek (Eds.), Proceedings of the Prague Stringology Conference 2013 (pp. 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. editor / Jan Holub ; Jan Žďárek. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, 2013. pp. 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. in J Holub & J Žďárek (eds), Proceedings of the Prague Stringology Conference 2013. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, pp. 168-175, Prague Stringology Conference, Prague, Czech Republic, 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. ed. / Jan Holub; Jan Žďárek. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, 2013. p. 168-175.

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-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. In Holub J, Žďárek J, editors, Proceedings of the Prague Stringology Conference 2013. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology. 2013. p. 168-175