Go to the corresponding LIPIcs Volume Portal 
Day, Joel D. ; Fleischmann, Pamela ; Kosche, Maria ; Koß, Tore ; Manea, Florin ; Siemer, Stefan
pdfformat: 

@InProceedings{day_et_al:LIPIcs.STACS.2021.25, author = {Day, Joel D. and Fleischmann, Pamela and Kosche, Maria and Ko{\ss}, Tore and Manea, Florin and Siemer, Stefan}, title = {{The Edit Distance to kSubsequence Universality}}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)}, pages = {25:125:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771801}, ISSN = {18688969}, year = {2021}, volume = {187}, editor = {Bl\"{a}ser, Markus and Monmege, Benjamin}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13670}, URN = {urn:nbn:de:0030drops136705}, doi = {10.4230/LIPIcs.STACS.2021.25}, annote = {Keywords: Subsequence, Scattered factor, Subword, Universality, ksubsequence universality, Edit distance, Efficient algorithms} }
Keywords:  Subsequence, Scattered factor, Subword, Universality, ksubsequence universality, Edit distance, Efficient algorithms  
Collection:  38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)  
Issue Date:  2021  
Date of publication:  10.03.2021 