@InProceedings{jansson_et_al:LIPIcs.STACS.2024.43,
author = {Jansson, Jesper and Sung, Wing-Kin and Tabatabaee, Seyed Ali and Yang, Yutong},
title = {{A Faster Algorithm for Constructing the Frequency Difference Consensus Tree}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {43:1--43:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.43},
URN = {urn:nbn:de:0030-drops-197539},
doi = {10.4230/LIPIcs.STACS.2024.43},
annote = {Keywords: phylogenetic tree, frequency difference consensus tree, tree algorithm, centroid path decomposition, max-Manhattan Skyline Problem}
}