A rearrangement distance for fully-labelled trees

@article{Bernardini2019ARD,
title={A rearrangement distance for fully-labelled trees},
author={G. Bernardini and P. Bonizzoni and G. D. Vedova and M. Patterson},
journal={ArXiv},
year={2019},
volume={abs/1904.01321}
}
• G. Bernardini, +1 author M. Patterson
• Published 2019
• Mathematics, Computer Science
• ArXiv
• 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., \emph{every} vertex has a label. In this paper we provide a rearrangement distance measure between two fully-labelled trees. This notion… CONTINUE READING
3 Citations

References

SHOWING 1-10 OF 39 REFERENCES