@InProceedings{bernardini_et_al:LIPIcs.CPM.2019.28,
author = {Bernardini, Giulia and Bonizzoni, Paola and Della Vedova, Gianluca and Patterson, Murray},
title = {{A Rearrangement Distance for Fully-Labelled Trees}},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
pages = {28:1--28:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-103-0},
ISSN = {1868-8969},
year = {2019},
volume = {128},
editor = {Pisanti, Nadia and P. Pissis, Solon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2019.28},
URN = {urn:nbn:de:0030-drops-104998},
doi = {10.4230/LIPIcs.CPM.2019.28},
annote = {Keywords: Tree rearrangement distance, Cancer progression, Approximation algorithms, Computational complexity}
}