@InProceedings{brubach:LIPIcs.CPM.2018.5,
author = {Brubach, Brian},
title = {{Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.5},
URN = {urn:nbn:de:0030-drops-87066},
doi = {10.4230/LIPIcs.CPM.2018.5},
annote = {Keywords: approximation algorithm, maximum duo-preservation string mapping, minimum common string partition, string comparison, streaming algorithm, comparative genomics}
}