Practical lower and upper bounds for the Shortest Linear Superstring

Show full item record



Permalink

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

Citation

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

Title: Practical lower and upper bounds for the Shortest Linear Superstring
Author: Cazaux, B.; Juhel, Samuel; Rivals, Eric
Editor: D'Angelo, Gianlorenzo
Contributor: University of Helsinki, Department of Computer Science
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Date: 2018
Language: eng
Number of pages: 14
Belongs to series: 17th International Symposium on Experimental Algorithms (SEA 2018)
Belongs to series: Leibniz International Proceedings in Informatics
ISBN: 9783959770705
URI: http://hdl.handle.net/10138/313241
Subject: 113 Computer and information sciences
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
LIPIcs_SEA_2018_18.pdf 635.3Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record