Anti Tai mapping for unordered labeled trees

DOI10.1016/j.ipl.2023.106454arXiv2107.08292OpenAlexW4387824366MaRDI QIDQ6195334

Stefan Canzar, Domagoj Matijević, Mislav Blažević, Khaled M. Elbassioni

Publication date: 13 March 2024

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial problemstree edit distanceunordered treesTai mappingclique constraints

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• On the editing distance between unordered labeled trees
• Geometric algorithms and combinatorial optimization.
• Some MAX SNP-hard results concerning unordered labeled trees
• Tai mapping hierarchy for rooted labeled trees through common subforest
• Cumulative disease progression models for cross-sectional data: A review and comparison
• The Tree-to-Tree Correction Problem
• On a matching distance between rooted phylogenetic trees

This page was built for publication: Anti Tai mapping for unordered labeled trees