String Inference from Longest-Common-Prefix Array

Show full item record



Permalink

http://hdl.handle.net/10138/232533

Citation

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 , International Colloquium on Automata, Languages and Programming , Warsaw , Poland , 10/07/2017 . https://doi.org/10.4230/LIPIcs.ICALP.2017.62

Title: String Inference from Longest-Common-Prefix Array
Author: Kärkkäinen, Juha; Piątkowski, Marcin; Puglisi, Simon J.
Editor: Chatzigiannakis, Ioannis; Indyk, Piotr; Kuhn, Fabian; Muscholl, Anna
Contributor: University of Helsinki, Practical Algorithms and Data Structures on Strings research group / Juha Kärkkäinen
University of Helsinki, Bioinformatics
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Date: 2017
Language: eng
Number of pages: 14
Belongs to series: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Belongs to series: Leibniz International Proceedings in Informatics (LIPIcs)
ISBN: 978-3-95977-041-5
URI: http://hdl.handle.net/10138/232533
Subject: 113 Computer and information sciences
LCP array
String inference
NP-hardness
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
LIPIcs_ICALP_2017_62.pdf 553.0Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record