scientific article; zbMATH DE number 7561381

DOI10.4230/LIPIcs.ISAAC.2018.27MaRDI QIDQ5091018

Takeyuki Tamura, Jesper Jansson, Ruiming Li, Tatsuya Akutsu, Atsuhiro Takasu

Publication date: 21 July 2022

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

zbMATH Keywords

dynamic programmingparameterized algorithmsunordered treestree inclusion

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

New and improved algorithms for unordered tree inclusion

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on tree edit distance and related problems
• Exact algorithms for computing the tree edit distance between unordered trees
• On the editing distance between unordered labeled trees
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• Some MAX SNP-hard results concerning unordered labeled trees
• Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
• Efficient exponential-time algorithms for edit distance between unordered trees
• Constrained tree inclusion
• The tree inclusion problem
• The Tree-to-Tree Correction Problem
• Color-coding
• Subtree Isomorphism Revisited
• Ordered and Unordered Tree Inclusion
• Consequences of Faster Alignment of Sequences
• Exact and approximate algorithms for unordered tree matching
• Algorithms and Computation

This page was built for publication: