
Open access
Date
2021-06-10Type
- Journal Article
Abstract
Background: Mutation trees are rooted trees in which nodes are of arbitrary degree and labeled with a mutation set. These trees, also referred to as clonal trees, are used in computational oncology to represent the mutational history of tumours. Classical tree metrics such as the popular Robinson–Foulds distance are of limited use for the comparison of mutation trees. One reason is that mutation trees inferred with different methods or for different patients often contain different sets of mutation labels. Results: We generalize the Robinson–Foulds distance into a set of distance metrics called Bourque distances for comparing mutation trees. We show the basic version of the Bourque distance for mutation trees can be computed in linear time. We also make a connection between the Robinson–Foulds distance and the nearest neighbor interchange distance. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000490252Publication status
publishedExternal links
Journal / series
Algorithms for Molecular BiologyVolume
Pages / Article No.
Publisher
BioMed CentralSubject
Labeled phylogenetic trees; mutation trees; The nearest neighbor interchange distance; Robinson− Foulds distance; Bourque distancesRelated publications and datasets
Is new version of: https://doi.org/10.3929/ethz-b-000447698
More
Show all metadata