A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression.

DOI10.4230/LIPIcs.WABI.2018.22zbMath1494.92045OpenAlexW2889141751MaRDI QIDQ5090362

No author found.

Publication date: 18 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.WABI.2018.22

zbMATH Keywords

dynamic programmingtree edit distancetumor evolutionmulti-labeled treeintra-tumor heterogeneity

Mathematics Subject Classification ID

Problems related to evolution (92D15) Dynamic programming (90C39) Computational methods for problems pertaining to biology (92-08) Pathology, pathophysiology (92C32)

Related Items (2)

The \(K\)-Robinson Foulds measures for labeled trees ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on tree edit distance and related problems
• An efficient algorithm for sequence comparison with block reversals
• Alignment of trees -- an alternative to tree edit
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• The tree-to-tree editing problem
• Some MAX SNP-hard results concerning unordered labeled trees
• Edit distance with block deletions
• New Algorithm for Ordered Tree-to-Tree Correction Problem
• Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The Tree-to-Tree Correction Problem
• More Efficient Algorithm for Ordered Tree Inclusion
• The String-to-String Correction Problem
• Ordered and Unordered Tree Inclusion
• Fibonacci heaps and their uses in improved network optimization algorithms
• Fast algorithms for the unit cost editing distance between trees

This page was built for publication: A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression.