String Inference from Longest-Common-Prefix Array

Juha Kärkkäinen, Marcin Piątkowski, Simon J. Puglisi

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

Original languageEnglish
Title of host publication44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
EditorsIoannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anna Muscholl
Number of pages14
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Publication date2017
Article number62
ISBN (Electronic)978-3-95977-041-5
DOIs
Publication statusPublished - 2017
MoE publication typeA4 Article in conference proceedings
EventInternational Colloquium on Automata, Languages and Programming - Warsaw, Poland
Duration: 10 Jul 201714 Jul 2017
Conference number: 44
http://icalp17.mimuw.edu.pl/

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Volume80
ISSN (Electronic)1868-8969

Fields of Science

  • 113 Computer and information sciences
  • LCP array
  • String inference
  • NP-hardness

Cite this

Kärkkäinen, J., Piątkowski, M., & Puglisi, S. J. (2017). String Inference from Longest-Common-Prefix Array. In I. Chatzigiannakis, P. Indyk, F. Kuhn, & A. Muscholl (Eds.), 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) [62] (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 80). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2017.62
Kärkkäinen, Juha ; Piątkowski, Marcin ; Puglisi, Simon J. / String Inference from Longest-Common-Prefix Array. 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). editor / Ioannis Chatzigiannakis ; Piotr Indyk ; Fabian Kuhn ; Anna Muscholl. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. (Leibniz International Proceedings in Informatics (LIPIcs)).
@inproceedings{2cd8e27652304927836cff0c1a4a16cc,
title = "String Inference from Longest-Common-Prefix Array",
keywords = "113 Computer and information sciences, LCP array, String inference, NP-hardness",
author = "Juha K{\"a}rkk{\"a}inen and Marcin Piątkowski and Puglisi, {Simon J.}",
year = "2017",
doi = "10.4230/LIPIcs.ICALP.2017.62",
language = "English",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
editor = "Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anna Muscholl",
booktitle = "44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)",
address = "Germany",

}

Kärkkäinen, J, Piątkowski, M & Puglisi, SJ 2017, String Inference from Longest-Common-Prefix Array. in I Chatzigiannakis, P Indyk, F Kuhn & A Muscholl (eds), 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)., 62, Leibniz International Proceedings in Informatics (LIPIcs), vol. 80, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, International Colloquium on Automata, Languages and Programming, Warsaw, Poland, 10/07/2017. https://doi.org/10.4230/LIPIcs.ICALP.2017.62

String Inference from Longest-Common-Prefix Array. / Kärkkäinen, Juha; Piątkowski, Marcin; Puglisi, Simon J.

44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). ed. / Ioannis Chatzigiannakis; Piotr Indyk; Fabian Kuhn; Anna Muscholl. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. 62 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 80).

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

TY - GEN

T1 - String Inference from Longest-Common-Prefix Array

AU - Kärkkäinen, Juha

AU - Piątkowski, Marcin

AU - Puglisi, Simon J.

PY - 2017

Y1 - 2017

KW - 113 Computer and information sciences

KW - LCP array

KW - String inference

KW - NP-hardness

U2 - 10.4230/LIPIcs.ICALP.2017.62

DO - 10.4230/LIPIcs.ICALP.2017.62

M3 - Conference contribution

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

BT - 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)

A2 - Chatzigiannakis, Ioannis

A2 - Indyk, Piotr

A2 - Kuhn, Fabian

A2 - Muscholl, Anna

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

ER -

Kärkkäinen J, Piątkowski M, Puglisi SJ. String Inference from Longest-Common-Prefix Array. In Chatzigiannakis I, Indyk P, Kuhn F, Muscholl A, editors, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2017. 62. (Leibniz International Proceedings in Informatics (LIPIcs)). https://doi.org/10.4230/LIPIcs.ICALP.2017.62