On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem

Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag. On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. In Laurent Bulteau, Zsuzsanna Lipták, editors, 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France. Volume 259 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Abstract

Abstract is missing.