@InProceedings{commins_et_al:LIPIcs.CPM.2020.11,
author = {Commins, Patty and Liben-Nowell, David and Liu, Tina and Tomlinson, Kiran},
title = {{Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.11},
URN = {urn:nbn:de:0030-drops-121367},
doi = {10.4230/LIPIcs.CPM.2020.11},
annote = {Keywords: edit distance, tree reconstruction, information propagation, chain letters}
}