A rearrangement distance for fully-labelled trees
From MaRDI portal
(Redirected from Publication:5088919)
Recommendations
- A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
- scientific article; zbMATH DE number 1302179
- The \(K\)-Robinson Foulds measures for labeled trees
- The Bourque distances for mutation trees of cancers
- Computing nearest neighbour interchange distances between ranked phylogenetic trees
Cites work
- A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
- A survey on tree edit distance and related problems
- Approximation and nonapproximability for the one-sided scaffold filling problem
- Efficient computation of the tree edit distance
- Fibonacci heaps and their uses in improved network optimization algorithms
- scientific article; zbMATH DE number 3661335 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 6472618 (Why is no real title available?)
- On the computational complexity of the rooted subtree prune and regraft distance
- Phylogeny. Discrete and random processes in evolution
- Reducibility among combinatorial problems
- Subtree transfer operations and their induced metrics on evolutionary trees
- The Tree-to-Tree Correction Problem
- Tree Isomorphism Algorithms: Speed vs. Clarity
This page was built for publication: A rearrangement distance for fully-labelled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088919)
