Cazaux , B , Juhel , S & Rivals , E 2018 , Practical lower and upper bounds for the Shortest Linear Superstring . in G D'Angelo (ed.) , 17th International Symposium on Experimental Algorithms (SEA 2018) . Leibniz International Proceedings in Informatics , vol. 103 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Dagstuhl , pp. 18:1-18:14 , International Symposium on Experimental Algorithms , L'Aquila , Italy , 27/06/2018 . https://doi.org/10.4230/LIPIcs.SEA.2018.18
Titel: | Practical lower and upper bounds for the Shortest Linear Superstring |
Författare: | Cazaux, B.; Juhel, Samuel; Rivals, Eric |
Medarbetare: | D'Angelo, Gianlorenzo |
Upphovmannens organisation: | Department of Computer Science |
Utgivare: | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Datum: | 2018 |
Språk: | eng |
Sidantal: | 14 |
Tillhör serie: | 17th International Symposium on Experimental Algorithms (SEA 2018) |
Tillhör serie: | Leibniz International Proceedings in Informatics |
ISBN: | 9783959770705 |
ISSN: | 1868-8969 |
DOI: | https://doi.org/10.4230/LIPIcs.SEA.2018.18 |
Permanenta länken (URI): | http://hdl.handle.net/10138/313241 |
Subject: | 113 Computer and information sciences |
Referentgranskad: | Ja |
Licens: | cc_by |
Användningsbegränsning: | openAccess |
Parallelpublicerad version: | publishedVersion |
Totalt antal nerladdningar: Laddar...
Filer | Storlek | Format | Granska |
---|---|---|---|
LIPIcs_SEA_2018_18.pdf | 635.3Kb | Granska/Öppna |