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

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

Alkuperäiskieli	englanti
Otsikko	Proceedings of the Prague Stringology Conference 2013
Toimittajat	Jan Holub, Jan Žďárek
Sivumäärä	8
Kustantaja	Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology
Julkaisupäivä	2013
Sivut	168-175
ISBN (painettu)	978-80-01-05330-0
Tila	Julkaistu - 2013
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	Prague Stringology Conference - Prague, Tšekki Kesto: 2 syysk. 2013 → 4 syysk. 2013

Tieteenalat

Kärkkäinen, J., Kempa, D., & Puglisi, S. (2013). Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications. teoksessa J. Holub, & J. Žďárek (Toimittajat), Proceedings of the Prague Stringology Conference 2013 (Sivut 168-175). Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology. http://stringology.org/event/2013/index.html

Kärkkäinen, Juha ; Kempa, Dominik ; Puglisi, Simon. / Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications. Proceedings of the Prague Stringology Conference 2013. Toimittaja / Jan Holub ; Jan Žďárek. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, 2013. Sivut 168-175

@inproceedings{4983bcf4e4fd4fa9bab3f2fc6c02bf25,

title = "Crochemore{\textquoteright}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",

year = "2013",

language = "English",

isbn = "978-80-01-05330-0",

pages = "168--175",

editor = "Jan Holub and Jan {\v Z}{\v d}{\'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",

note = "Prague Stringology Conference ; Conference date: 02-09-2013 Through 04-09-2013",

}

Kärkkäinen, J, Kempa, D & Puglisi, S 2013, Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications. julkaisussa J Holub & J Žďárek (toim), Proceedings of the Prague Stringology Conference 2013. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, Sivut 168-175, Prague Stringology Conference, Prague, Tšekki, 02/09/2013. <http://stringology.org/event/2013/index.html>

Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications. / Kärkkäinen, Juha; Kempa, Dominik; Puglisi, Simon.
Proceedings of the Prague Stringology Conference 2013. toim. / Jan Holub; Jan Žďárek. Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, 2013. s. 168-175.

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

TY - GEN

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

AU - Kärkkäinen, Juha

AU - Kempa, Dominik

AU - Puglisi, Simon

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

T2 - Prague Stringology Conference

Y2 - 2 September 2013 through 4 September 2013

ER -