scientific article; zbMATH DE number 7559196

DOI10.4230/LIPIcs.CPM.2019.28MaRDI QIDQ5088919

Gianluca Della Vedova, Giulia Bernardini, Murray Patterson, Paola Bonizzoni

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1904.01321

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityapproximation algorithmscancer progressiontree rearrangement distance

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on tree edit distance and related problems
• On the computational complexity of the rooted subtree prune and regraft distance
• Phylogeny
• Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem
• Tree Isomorphism Algorithms: Speed vs. Clarity
• The Tree-to-Tree Correction Problem
• Reducibility among Combinatorial Problems
• Efficient Computation of the Tree Edit Distance
• A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression.
• Fibonacci heaps and their uses in improved network optimization algorithms
• Subtree transfer operations and their induced metrics on evolutionary trees

This page was built for publication: