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.

Bernardini, G., Bonizzoni, P., Della Vedova, G., Patterson, M. (2019). A rearrangement distance for fully-labelled trees. Intervento presentato a: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, ita [10.4230/LIPIcs.CPM.2019.28].

A rearrangement distance for fully-labelled trees

Bernardini, G
;
Bonizzoni, P
;
Della Vedova, G
;
Patterson, M
2019

Abstract

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.
No
paper
Approximation algorithms; Cancer progression; Computational complexity; Tree rearrangement distance;
Tree rearrangement distance, Cancer progression, Approximation algorithms, Computational complexity
English
30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
9783959771030
http://drops.dagstuhl.de/opus/institut_lipics.php?fakultaet=04
Bernardini, G., Bonizzoni, P., Della Vedova, G., Patterson, M. (2019). A rearrangement distance for fully-labelled trees. Intervento presentato a: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, ita [10.4230/LIPIcs.CPM.2019.28].
Bernardini, G; Bonizzoni, P; Della Vedova, G; Patterson, M
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/232040
Citazioni
  • Scopus 4
  • ???jsp.display-item.citation.isi??? ND
Social impact