New and improved algorithms for unordered tree inclusion
type: Item
instance of: scholarly article
title: New and improved algorithms for unordered tree inclusion
author: Tatsuya Akutsu
author: Jesper Jansson
author: Ruiming Li
author: Atsuhiro Takasu
author: Takeyuki Tamura
published in: Theoretical Computer Science
publication date: 2021-08-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1712.05517
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9975/
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7387694
zbMATH Keywords: tree inclusion
zbMATH Keywords: unordered trees
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: dynamic programming
describes a project that uses: RTED
describes a project that uses: TED
describes a project that uses: KEGG
MaRDI profile type: Publication
OpenAlex ID: W3173543202
cites work: Subtree Isomorphism Revisited
cites work: Consequences of Faster Alignment of Sequences
cites work: Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
cites work: Exact algorithms for computing the tree edit distance between unordered trees
cites work: Q5091018
cites work: Efficient exponential-time algorithms for edit distance between unordered trees
cites work: Color-coding
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: A survey on tree edit distance and related problems
cites work: The tree inclusion problem
cites work: 1+ ε approximation of tree edit distance in quadratic time
cites work: Q4607965
cites work: An optimal decomposition algorithm for tree edit distance
cites work: Q4198056
cites work: Ordered and Unordered Tree Inclusion
cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees
cites work: Exact and approximate algorithms for unordered tree matching
cites work: The Tree-to-Tree Correction Problem
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Constrained tree inclusion
cites work: Algorithms and Computation
cites work: Some MAX SNP-hard results concerning unordered labeled trees
cites work: On the editing distance between unordered labeled trees
DOI: 10.1016/J.TCS.2021.06.013
description: scientific article; zbMATH DE number 7387694