On the Complexity of String Matching for Graphs

Show full item record



Permalink

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

Title: On the Complexity of String Matching for Graphs
Author: Equi, Massimo; Grossi, Roberto; Mäkinen, Veli; Tomescu, Alexandru
Other contributor: Baier, Christel
Chatzigiannakis, Ioannis
Flocchini, Paola
Leonardi, Stefano
Contributor organization: Department of Computer Science
Genome-scale Algorithmics research group / Veli Mäkinen
Helsinki Institute for Information Technology
Bioinformatics
Algorithmic Bioinformatics
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Date: 2019
Language: eng
Number of pages: 15
Belongs to series: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Belongs to series: 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
URI: http://hdl.handle.net/10138/310140
Subject: 113 Computer and information sciences
Peer reviewed: Yes
Rights: cc_by
Usage restriction: openAccess
Self-archived version: publishedVersion


Files in this item

Total number of downloads: Loading...

Files Size Format View
LIPIcs_ICALP_2019_55.pdf 704.0Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record