文章基本信息

标题：A Rearrangement Distance for Fully-Labelled Trees
本地全文：下载
作者：Giulia Bernardini ; Paola Bonizzoni ; Gianluca Della Vedova 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：128
页码：1-15
DOI：10.4230/LIPIcs.CPM.2019.28
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：The problem of comparing trees representing the evolutionary histories of cancerous tumors has turned out to be crucial, since there is a variety of different methods which typically infer multiple possible trees. A departure from the widely studied setting of classical phylogenetics, where trees are leaf-labelled, tumoral trees are fully labelled, i.e., every vertex has a label. In this paper we provide a rearrangement distance measure between two fully-labelled trees. This notion originates from two operations: one which modifies the topology of the tree, the other which permutes the labels of the vertices, hence leaving the topology unaffected. While we show that the distance between two trees in terms of each such operation alone can be decided in polynomial time, the more general notion of distance when both operations are allowed is NP-hard to decide. Despite this result, we show that it is fixed-parameter tractable, and we give a 4-approximation algorithm when one of the trees is binary.
关键词：Tree rearrangement distance; Cancer progression; Approximation algorithms; Computational complexity