String Inference from Longest-Common-Prefix Array

Visa fullständig post



Permalänk

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

Titel: String Inference from Longest-Common-Prefix Array
Författare: Kärkkäinen, Juha; Piątkowski, Marcin; Puglisi, Simon J.
Editor: Chatzigiannakis, Ioannis; Indyk, Piotr; Kuhn, Fabian; Muscholl, Anna
Medarbetare: University of Helsinki, Practical Algorithms and Data Structures on Strings research group / Juha Kärkkäinen
University of Helsinki, Bioinformatics
Utgivare: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Datum: 2017
Språk: eng
Sidantal: 14
Tillhör serie: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Tillhör serie: Leibniz International Proceedings in Informatics (LIPIcs)
ISBN: 978-3-95977-041-5
Permanenta länken (URI): http://hdl.handle.net/10138/232533
Subject: 113 Computer and information sciences
LCP array
String inference
NP-hardness
Licens:


Filer under denna titel

Totalt antal nerladdningar: Laddar...

Filer Storlek Format Granska
LIPIcs_ICALP_2017_62.pdf 553.0Kb PDF Granska/Öppna

Detta dokument registreras i samling:

Visa fullständig post