pdf-format: |
|
@InProceedings{bulteau_et_al:LIPIcs:2018:9583, author = {Laurent Bulteau and Markus L. Schmid}, title = {{Consensus Strings with Small Maximum Distance and Small Distance Sum}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {1:1--1:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Igor Potapov and Paul Spirakis and James Worrell}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9583}, URN = {urn:nbn:de:0030-drops-95834}, doi = {10.4230/LIPIcs.MFCS.2018.1}, annote = {Keywords: Consensus String Problems, Closest String, Closest Substring, Parameterised Complexity, Kernelisation} }
Keywords: | Consensus String Problems, Closest String, Closest Substring, Parameterised Complexity, Kernelisation | |
Seminar: | 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) | |
Issue date: | 2018 | |
Date of publication: | 27.08.2018 |