On the Complexity of String Matching for Graphs

Visa fullständig post



Permalänk

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

Citation

Equi , M , Grossi , R , Mäkinen , V & Tomescu , A 2019 , On the Complexity of String Matching for Graphs . in C Baier , I Chatzigiannakis , P Flocchini & S Leonardi (eds) , 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) . Leibniz International Proceedings in Informatics (LIPIcs) , vol. 132 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Dagstuhl, Germany , pp. 55:1--55:15 , International Colloquium on Automata, Languages and Programming , Patras , Greece , 08/07/2019 . https://doi.org/10.4230/LIPIcs.ICALP.2019.55

Titel: On the Complexity of String Matching for Graphs
Författare: Equi, Massimo; Grossi, Roberto; Mäkinen, Veli; Tomescu, Alexandru
Medarbetare: Baier, Christel
Chatzigiannakis, Ioannis
Flocchini, Paola
Leonardi, Stefano
Upphovmannens organisation: Department of Computer Science
Genome-scale Algorithmics research group / Veli Mäkinen
Helsinki Institute for Information Technology
Bioinformatics
Algorithmic Bioinformatics
Utgivare: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Datum: 2019
Språk: eng
Sidantal: 15
Tillhör serie: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Tillhör serie: Leibniz International Proceedings in Informatics (LIPIcs)
ISBN: 978-3-95977-109-2
ISSN: 1868-8969
DOI: https://doi.org/10.4230/LIPIcs.ICALP.2019.55
Permanenta länken (URI): http://hdl.handle.net/10138/310140
Subject: 113 Computer and information sciences
Referentgranskad: Ja
Licens: cc_by
Användningsbegränsning: openAccess
Parallelpublicerad version: publishedVersion


Filer under denna titel

Totalt antal nerladdningar: Laddar...

Filer Storlek Format Granska
LIPIcs_ICALP_2019_55.pdf 704.0Kb PDF Granska/Öppna

Detta dokument registreras i samling:

Visa fullständig post