@InProceedings{castelli_et_al:LIPIcs.CPM.2017.14,
author = {Castelli, Mauro and Dondi, Riccardo and Mauri, Giancarlo and Zoppis, Italo},
title = {{The Longest Filled Common Subsequence Problem}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {14:1--14:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.14},
URN = {urn:nbn:de:0030-drops-73293},
doi = {10.4230/LIPIcs.CPM.2017.14},
annote = {Keywords: longest common subsequence, approximation algorithms, computational complexity, fixed-parameter algorithms}
}